LeetCode- 33. Search in Rotated Sorted Array

This is the search in a rotated sorted array problem on leetcode.

Key Observations & Summary:
1. The minimum element of the rotated sorted array is the key element for us.
2. We need to find that element and once that is done we simply do a binary search either on the right or the left sorted array.