Binary search algorithm
Search requires the following steps:
1. Inspect the middle item of an array of size N.
2. Inspect the middle of an array of size N/2
3. Inspect the middle item of an array of size N/power(2,2) and so on until N/power(2,k) = 1.
- This implies k = log2N
- k is the number of partitions.