Anonymous user
User talk:Paul.miner: Difference between revisions
→Call for assistance: new section
(Thank you! Welcome!) |
(→Call for assistance: new section) |
||
Line 2:
Weird; I thought I'd welcomed you already. I'm pretty sure I've read your piece on converting a welder from AC to DC. Anyway, thanks for all the Java work, and the debugging details on MD5! If you're interested, there's plenty more need for [[Reports:Tasks not implemented in Java|help with Java]]. --[[User:Short Circuit|Michael Mol]] 17:46, 10 January 2011 (UTC)
== Call for assistance ==
Hi there. I've seen your Java edits and I think you can help me. I tried to make up my own recursive algorithm for [[Levenshtein distance]]. I coded it up, but it gets some incorrect answers. I got some help [[User_talk:Dingowolf#Levenshtein_distance.2C_recursive_D_solution|here]], but I wanted to see if you could look at it too. The code is at [[User:Mwn3d/Levenshtein distance]]. It's not very cleaned up yet and there are sitll things left over from older fixes that didn't work. Thanks in advance. --[[User:Mwn3d|Mwn3d]] 16:02, 13 January 2011 (UTC)
| |||