take a BST whose node has an element of frequency .and another array which will store order of elements. for each array element search BST if node already exists increase the freq count ..other wise add that element in the order array we took and insert new node in BST.
now , scan the order array find its corresponding element in BST and its frequency, print it that many times. let me know if there is any bttr method thx! On Jul 30, 11:58 pm, sukhmeet singh <sukhmeet2...@gmail.com> wrote: > maintain a count array of all elements.. > now traverse the array again and the count array .. and build the new array > > On Sun, Jul 31, 2011 at 12:24 AM, aditi garg <aditi.garg.6...@gmail.com>wrote: > > > > > > > > > Q1) Given an array with some repeating numbers. Like 12,6,5,12,6 > > output: 12,12,6,6,5 > > > 12 shud come before 6 since it is earlier in list. Please provide a > > gud algo fr dis > > > -- > > You received this message because you are subscribed to the Google Groups > > "Algorithm Geeks" group. > > To post to this group, send email to algogeeks@googlegroups.com. > > To unsubscribe from this group, send email to > > algogeeks+unsubscr...@googlegroups.com. > > 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 algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
