Length of array = n
=> log2 (n) = log2 (2k) => log2 (n) = k log2 (2)
=> k = log2 (n)
Average case:O(log n) Best case:O(1)