Anonymous user
Levenshtein distance: Difference between revisions
m
→{{header|Dyalect}}
m (→{{header|F#}}: Corrected header as suggested on the Count examples/Full list/Tier 4 talk page) |
|||
Line 1,659:
<lang dyalect>func levenshtein(s, t) {
var n = s.
var m = t.
var d = Array.
if n == 0 {
return m
Line 1,674:
d[i][0] = i
}
for j in 0..m {
d[0][j] = j
Line 1,693:
}
}
d[n][m]
}
func run(x, y) {
print("\(x) -> \(y) = \(levenshtein(x, y))")
}
run("rosettacode", "raisethysword")</lang>
|