User talk:Ledrug: Difference between revisions
→Hough transform C code: new section
(→Hough transform C code: new section) |
|||
Line 20:
:::::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)
== Hough transform C code ==
Rather than adding {{tmpl|incorrect}}, it's probably more appropriate to just fix the code. Also, while I definitely appreciate the expertise and perspective I've seen you bringing to many areas across the wiki, calling code out as a 'shame', particularly in the page body itself, is inappropriate. Since the code implements the task, it's technically correct. If you'd like to raise suggested fixes (without implementing them yourself), you should raise them in the talk pages, as you've been doing elsewhere. --[[User:Short Circuit|Michael Mol]] 01:10, 23 June 2011 (UTC)
| |||