Find an element from a rotated sorted array.
Anonymous
try to imagin the graph . . . .if the previous array was in increasing order then after rotation the two sub aarays will also be in increasing order except one sudden fall . . O(log n/2)
Check out your Company Bowl for anonymous work chats.