By the way, if I had to hazard a guess I'd say he's computing a distance of some kind between the two strings, possibly the Hamming distance, and possibly for a spellchecker or something similar. Though spellcheckers generally do their comparisons on strings small enough that O(n^3) asymptotic behavior shouldn't be a big issue ...
Certainly, the return value grows with q, which grows the less the two strings have in common. That much is certain from looking at the code. -- Protege: What is this seething mass of parentheses?! Master: Your father's Lisp REPL. This is the language of a true hacker. Not as clumsy or random as C++; a language for a more civilized age. -- You received this message because you are subscribed to the Google Groups "Clojure" group. To post to this group, send email to clojure@googlegroups.com Note that posts from new members are moderated - please be patient with your first post. To unsubscribe from this group, send email to clojure+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/clojure?hl=en
