we can use hashtable to maintain count of each number coming from the file.
now make a MIN heap of size K now every time a count is updated in the hastable , compare it with the root of the Min heap. if root of heap is smaller then replace it with new greater count and then heapify again. In the end you will be having k most frequent numbers. On Sat, Dec 17, 2011 at 8:50 PM, Ankur Garg <ankurga...@gmail.com> wrote: > suggest algo to find k most frequently occuring numbers from a file of > very large size containing numbers. > > -- > 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. > -- 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.
