@Shady: An O(log n) solution is not possible. Just consider an array n-1 ones and 1 zero. Since the zero can occur in any location, you are going to have to do O(n) operations to find it. Dave
On Friday, August 3, 2012 12:02:09 PM UTC-5, shady wrote: > Hi, > Can anyone tell how to find local minima in an unsorted array ? > Recommended solution : O(log(n)) > > Shady. > -- 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/-/wERhlcQT5mIJ. 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.
