@ankur : if i am able to figure out a better solution , i will post.but i guess nlogn is the best we can get.
On Sun, Dec 25, 2011 at 4:50 PM, Ankur Garg <[email protected]> wrote: > @Atul..your solution is correct and would do the job but its complexity > wud be nlogn . > > Any better way of solving it ? > > Regards > Ankur > > > On Sun, Dec 25, 2011 at 2:10 AM, sravanreddy001 > <[email protected]>wrote: > >> any better approach than O(N log N) time? >> >> maintain a heap of nodes <value, count> >> for each element, if already present increase the count. Else add the >> elements. >> >> Max-Heap --> fetch the node, print it count number of times, (time to >> search in heap -- log N) >> doing this for N elements. >> >> >> -- >> 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/-/rJMBHTFmv8IJ. >> >> 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. >> > > -- > 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. > -- 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.
