Various sorting algorithms visualisedInsertion // Selection // Bubble // Shell // Merge // Heap // Quick // Quick3

Various scripts of various programming/scripting languages for the solving of the Levenshtein distance (String Distance). No Damerau.

How Levenshtein works...The Levenshtein algorithm (also called Edit-Distance) calculates the least number of edit operations that are necessary to modify one string to obtain another string. The most common way of calculating this is by the dynamic programming approach.

Compare two Strings, using Damerau-Levenshtein distance in T-SQLThis is the most informative calculator demonstrating the Damerau-Levenshtein distance algorithm!

"A very fast random number generator Of period 219937-1"