Search
Results
qDUsx0M.gif (720×364)
[http://i.imgur.com/qDUsx0M.gif] - - public:Trinsec
Various sorting algorithms visualisedInsertion // Selection // Bubble // Shell // Merge // Heap // Quick // Quick3
Algorithm Implementation/Strings/Levenshtein distance - Wikibooks, open books for an open world
[https://en.wikibooks.org/wiki/Algorithm_Implementation/Strings/Levenshtein_distance] - - public:Trinsec
Various scripts of various programming/scripting languages for the solving of the Levenshtein distance (String Distance). No Damerau.
Efficient Implementation of the Levenshtein-Algorithm, Fault-tolerant Search Technology, Error-tolerant Search Technologies
[http://www.levenshtein.net] - - public:Trinsec
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.
fuzzy-string.com ~ Compare two Strings, using Damerau-Levenshtein distance in T-SQL
[http://fuzzy-string.com/Compare/] - - public:Trinsec
Compare two Strings, using Damerau-Levenshtein distance in T-SQLThis is the most informative calculator demonstrating the Damerau-Levenshtein distance algorithm!
Mersenne Twister: A random number generator (since 1997/10)
[http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/emt.html] - - public:Trinsec
"A very fast random number generator Of period 219937-1"