This is a standard map reduce problem. 1. reduce the file by word: sending words into machines based on it's val. 2. count words, return top 10 words in each machine. 3. aggregate results together to get top 10.
-weiq On Wed, Feb 2, 2011 at 8:46 AM, bittu <[email protected]> wrote: > @sankalp ...You seems to be right & also u told u like trie..so > could u elaborate the approach given by you by giving some example > algo or code.. > > although hastable/hashmap..is also alternative of such problem but > wants to see your explanation about this question .because a problem > can be solved by many ways but only best way so Explain with Example > > Thanks > Shashank > > -- > 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.
