if it can be loaded we can use map , else look for external sorting coming to second point it dynamically changing leads lot of other questions before going give algo .
On Sat, Sep 8, 2012 at 7:43 PM, Navin Kumar <algorithm.i...@gmail.com>wrote: > Given a file which has billions of words and file can be loaded in > memory. Now find 10 most frequent words in file. What if file is > dynamically changing means words are continuously added to it. > > What if file cant be loaded in memory. > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To view this discussion on the web visit > https://groups.google.com/d/msg/algogeeks/-/UcdJKQHPGzoJ. > To post to this group, send email to algogeeks@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- Regards Kumar Vishal _________________________________________ *http://wethecommonpeople.wordpress.com/ * *h**ttp://kumartechnicalarticles.wordpress.com/<http://kumartechnicalarticles.wordpress.com/> * _________________________________________ -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
