🏔️ The Twisted Mountain

📚 How Rotated Search Works

A sorted array that's been rotated (e.g., [4,5,6,7,0,1,2]) has a special property:

• At least one half (left or right of mid) is always sorted
• Check if arr[left] ≤ arr[mid] → Left half is sorted
• Otherwise → Right half is sorted
• If target is in the sorted half's range → search there
• Otherwise → search the other half