1. Binary Search to find X in sorted array

2. Implement Lower Bound

3. Implement Upper Bound

4. Search Insert Position

5. Floor/Ceil in Sorted Array

6. Find the first or last occurrence of a given number in a sorted array

7. Count occurrences of a number in a sorted array with duplicates

8. Search in Rotated Sorted Array I

9. Search in Rotated Sorted Array II

10. Find minimum in Rotated Sorted Array

11. Find out how many times an array has been rotated

12. Single element in a Sorted Array

13. Find peak element