Hashmapping.... O(n) On 25-Dec-2011 2:15 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.
