This one was interesting for me: I'm pretty new to haskell and this is my first time playing around with memoization (without memoization, the lev function is absurdly slow).
The lev function is a recursive implementation of the Levenshtein distance from the Wikipedia article
For further actions, you may consider blocking this person and/or reporting abuse
We're a place where coders share, stay up-to-date and grow their careers.
Haskell:
This one was interesting for me: I'm pretty new to haskell and this is my first time playing around with memoization (without memoization, the
lev
function is absurdly slow).The lev function is a recursive implementation of the Levenshtein distance from the Wikipedia article