i think gene is correct in normal RAM it is impossible.... @abhishek you are talking about parallel algorithms but till this extent is not possible to implement in general computers.. @abhinav you was correct.. firsst we will have to make heap tree which is impossible in log(n) time...
On Sun, Jun 3, 2012 at 11:23 PM, Gene <[email protected]> wrote: > 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 <[email protected]> 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 > > **[email protected] > > -- > 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. > > -- Thanks and Regards: Rahul Kumar Patle M.Tech, School of Information Technology Indian Institute of Technology, Kharagpur-721302, India Mobile No: +91-8798049298, +91-9424738542 [email protected] [email protected] -- 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.
