how would we keep account of first in first out then...i mean first index should be printed first in case of a tie
On Fri, Jul 2, 2010 at 11:48 PM, Amir hossein Shahriari < [email protected]> wrote: > i think that the best method would be a balanced binary search tree which > counts the number of appearances for each element > O(nlogn) > > -- > 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]<algogeeks%[email protected]> > . > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- With Regards, Jalaj Jaiswal +919026283397 B.TECH IT IIIT ALLAHABAD -- 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.
