http://en.wikipedia.org/wiki/Selection_algorithm choose the best algorithm to select kth element and then traverse it once finding the min element from the kth element. morever you can go for finding kth smallest element you can go for median of median algorithm..
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. > -- ~~~~BL/\CK_D!AMOND~~~~~~~~ -- 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.
