As array is not sorted, how do you decide to move left or right ?
On Sun, Jun 24, 2012 at 12:41 AM, adarsh kumar <algog...@gmail.com> 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 <hmonfa...@gmail.com>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 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.
>
--
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.
