How about using a Tournament tree . As the size of the size of huge we heap is better option to opt for , which is also been implemented in Tournament tree , and when the same element come more than once just increment the count for the Frequency of the Internal Node . The leaves will contain either NULL or the segmented files from the actual file.
The segmented files are sorted separately before they are processed. -- 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.
