User talk:Ledrug: Difference between revisions
Content added Content deleted
m (→Levenshtein distance C code: (signing)) |
|||
| Line 19: | Line 19: | ||
:::: But the wikipedia solution <i>is</i> the memoized version, though? --[[User:Ledrug|Ledrug]] 22:26, 20 June 2011 (UTC) |
:::: But the wikipedia solution <i>is</i> the memoized version, though? --[[User:Ledrug|Ledrug]] 22:26, 20 June 2011 (UTC) |
||
:::::Hi, there are no recursive calls [http://en.wikipedia.org/wiki/Levenshtein_distance#Computing_Levenshtein_distance here]. --[[User:Paddy3118|Paddy3118]] 05:15, 21 June 2011 (UTC) |
:::::Hi, there are no recursive calls [http://en.wikipedia.org/wiki/Levenshtein_distance#Computing_Levenshtein_distance here]. --[[User:Paddy3118|Paddy3118]] 05:15, 21 June 2011 (UTC) |
||
:::::: Yeah I know, I meant if you memoize the results and convert recursion to iteration, they are exactly the same algorithm. I guess recursive version expresses the idea better, maybe. --[[User:Ledrug|Ledrug]] 05:18, 21 June 2011 (UTC) |
|||