Question

Given a sorted array of n integers that has been rotated an unknown number of times, design and implement an o(log n) algorithm that finds an element in the array. You may assume that the array was originally sorted in increasing order.

Answer 1

Explanation:

Given a sorted array of n integers that has been rotated an unknown number of times, design and implement an o(log n) algorithm that finds an element in the array. You may assume that the array was originally sorted in increasing