FLL versus Fox code
The other day, I mentioned the Levenshtein distance FLL I wrote. At the time, I had forgotten to time it. I downloaded Bob Calco’s Fox implementation from Ed Leafe’s download page, and ran it 10K times: it took about 2.2 seconds each time.
Then I tested the C version. It ran in 0.1 seconds each time. I like this. :-)
As soon as I get a chance to replicate the steps I went through, I’ll post it: I don’t want to just toss the FLL up without commentary.
Posted by Garrett on November 22nd, 2007 in Original, VFP | No Comments
