Thread: encryption algorithm for finding the most frequent word

Originally Posted by r00t

yep, it should be called bucket sort, but i dont remember the exact name.
and yes, the whole point of this thread was to discover the right algorithm to encrypt it

With a max word length of 30 characters.. Even if you are just using a limited character set of a-z and A-Z that's a huuuge number of different combinations. And if you scale up to unicode it grows even more. It's impossible to find a hashing or compression algorithm that won't produce collisions for 0 < N < 50000

Originally Posted by r00t

thanx for the code _Mike, i'll have a look at it

You're welcome. Though I kinda misunderstood what was required so it doesn't do any hashing of the words. It just counts them.
But I guess you can use it as an example on how to create a linked list or whatever

that's a huuuge number of different combinations

yeaaah i know i know... any suggestions?
i think what im gonna do is (as it was suggested above) sort the words into the array
and the count the most frequent one, that's an easy way of doing it...
but you know, i wanted to do it "smart and elegant" applying some kinda math
thanx anyways!