Hi, I have found two url which contain answer of your question some extent.
42bits.wordpress.com/2010/04/17/find-kth-minimum-in-a-unsorted-array/ http://www.medwelljournals.com/fulltext/?doi=rjasci.2011.70.75 On Sun, Jun 3, 2012 at 8:31 PM, abhinav gupta <abhinav....@gmail.com> wrote: > > We have given a list 14 6 7 15 8 9 ............we have to find 15 in > (log n ) times. > -- > > *Thanks and Regards,* > > Abhinav Kumar Gupta > **abhinav....@gmail.com > > -- > 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.