just found a good resource for 1d and 2D version : http://courses.csail.mit.edu/6.006/spring11/lectures/lec02.pdf
On Sun, Jun 24, 2012 at 3:31 AM, sengar.mahi <[email protected]> wrote: > @adarsh :its nt dat easy as u see it.. > > > On Sun, Jun 24, 2012 at 1:45 AM, Sourabh Singh > <[email protected]>wrote: > >> @adarsh kumar >> >> are u sure it's worst case will be O (log n) ?? >> i think iff array is fully sorted O(n) will be required to say "NO >> such element present" >> >> On Sat, Jun 23, 2012 at 1:11 PM, adarsh kumar <[email protected]> wrote: >> > This is a variation of binary search, the difference being that we have >> to >> > search for an element that is greater than its immediate left one and >> lesser >> > than its immediate right one. Just implement binary search with these >> > additional constraints, thereby giving O(log n). >> > In case of any difficulty/error, let me know. >> > >> > On Sun, Jun 24, 2012 at 1:27 AM, Hassan Monfared <[email protected]> >> > wrote: >> >> >> >> Given an array of integers find a peak element of array in log(n) time. >> >> for example if A={3,4,6,5,10} then peak element is 6 ( 6>5 & 6>4 ). >> >> >> >> Regards. >> >> >> >> -- >> >> You received this message because you are subscribed to the Google >> Groups >> >> "Algorithm Geeks" group. >> >> To view this discussion on the web visit >> >> https://groups.google.com/d/msg/algogeeks/-/AQI6ahWgyOIJ. >> >> 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. >> > >> > >> > -- >> > 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. >> >> -- >> 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. >> >> > > > -- > *Regards* > Mahendra Pratap Singh Sengar > B-tech 4/4 > NIT Warangal. > > Facebook ID <http://www.facebook.com/mkingmahi> > > -- > 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. > -- 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.
