Description: The Levenshtein Distance between two strings a, b is the number of changes to transform one string into another. For example to transform mouse into house would take 1 (change the m to an h). If the strings are different length then either characters need to be added or removed. The total number of operations needed (inserts, deletes or changes) is the Levenshtein distance.
To Search:
File list (Check if you may need any files):
Submission39.cs
hr_time.c
hr_time.h
LevenshteinDistance_c.c
output.txt
LevenshteinDistance_c_vc.c
Download