Question

Given an array of size n and multiple values around which we need to left rotate the array.

Answer 1

Explanation:

✍✍✍✍Search an element in a sorted and rotated array. An element in a sorted array can be found in O(log n) time via binary search.

But suppose we rotate an ascending order sorted array at some pivot unknown to you beforehand.

Answer 2

Answer:

your answer

Explanation:

thank you for asking