select algorithm in order statistics given in cormen book. get kth smallest element in O(n) and output all array elements from index 0 to the index of that kth smallest element. So better than Heap approach which is O(n+klogn)
Thanks & regards, Laxmikant Agrawal "Journey is more important than final goal." On Sun, Mar 28, 2010 at 2:14 AM, sharad kumar <[email protected]>wrote: > i feel heapify the array to get a min heap and keep extracting root k > times.any further optimisations??? > > > > On Sun, Mar 28, 2010 at 11:33 AM, Priyanka Chatterjee <[email protected] > > wrote: > >> Design the most efficient algorithm to find the first k smallest elements >> in an array ? >> >> -- >> Thanks & Regards, >> Priyanka Chatterjee >> Third Year Undergraduate Student, >> Computer Science & Engineering, >> National Institute Of Technology,Durgapur >> India >> http://priyanka-nit.blogspot.com/ >> >> -- >> 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. >> > > -- > 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. > -- 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.
