search for: unsimilar

...pected, current hash function uses full pass through the string to get a hash key. So, in particular, can anyone clearly show that the current hash-based algorithm will be quicker then sort-based algorithm if the input has: 1. a lot of strings; 2. strings are very long; 3. strings are quite unsimilar ? Hm, I don't believe you are ready to prove smth. like that. P.S. Sorry for broken email-reference. I am bound to Outlook Express now. -- Valery