33. Search in Rotated Sorted Array

Description:

Solution:

We are gonna set l, r, m pointers to find in O(logn).

 

If l pointer value is less than m pointer value:

• target should be between l and m or between m and r.
• if target is more than m value or target is less than l value, we are gonna see right portion, except left portion.
• else we are gonna see left portion, except right portion.

If r value is less than m value:

• target can be between l and m or between m and r.
• if target is less than m value or target is more than r value, we are gonna see the left portion except right portion.
• else we are gonna see right portion, except left portion.