文学城新闻图片# Joke - 肚皮舞运动
v*n
1 楼
Given a sorted array of n integers that has been rotated an unknown number
of times, give an O(log n) algorithm that finds an element in the array. You
may assume that the array was originally sorted in increasing order.
of times, give an O(log n) algorithm that finds an element in the array. You
may assume that the array was originally sorted in increasing order.
