Finding a given element in an unsorted list in less than O(n) time (with a normal RAM model of computation) is easy to prove impossible.
On Jun 3, 11:01 am, 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.
