Euclid’s(Euclidean) Algorithm Algorithm to find GCD of two large numbers GCD(N1, N2), suppose that N1 is larger than N2 N1 = N2 * q1 + r1 ...

#
*Category* ‧ Algorithm

# Levenshtein Distance

Levenshtein distance (LD) is a measure of the similarity between two strings, and it is a minimum costs to transform a string to the other using ...