finding an element of in a sorted array thats shifted
Posted
by hao
on Stack Overflow
See other posts from Stack Overflow
or by hao
Published on 2010-06-02T21:20:03Z
Indexed on
2010/06/02
21:24 UTC
Read the original article
Hit count: 125
algorithm
Say the original list is 1 2 3 4 5 6 7 8 9 10
and u shift it so that it becomes
5 6 7 8 9 10 1 2 3 4
so say i want to check if 7 is in the array. how would i do this efficiently.
© Stack Overflow or respective owner