Can we apply another approach

#1

We first find the pivot element about which the array is rotated and then apply binary search on the subarray. will it be time efficient??

#2

Yes you can find the find the pivot element in log n time , and then do binary search in the suitable subarray, so it is time efficient .