*TRIE*: Using a trie we would get a linear time solution but i think the memory requirement would be huge ..
On Mon, Dec 14, 2009 at 11:02 PM, vicky <[email protected]> wrote: > Given a file with a lot of words (10 million) find out the top 10% > most > frequently occuring words. > > -- > > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to [email protected]. > To unsubscribe from this group, send email to > [email protected]<algogeeks%[email protected]> > . > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > > > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
