@shashank: sorting the hashed values is more intensive than using the heap with size K. (as k<<N) sorting hash --> N log N using heap --> N log k
also, i just read about the splay trees.. this can improve the performance of 'N log N factor' right when used on input, though it can be used on a heap as well too, esp *when there are few frequent & many infrequent.* is my understanding of splay trees correct? (the underlined part) -- 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/-/RRXDiXhNEuEJ. 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.
