Question: how to find the time complexity of binary search?
Answer: Let say the iteration in Binary Search terminates after k iterations. ... 
At each iteration, the array is divided by half. ... 
At Iteration 1, Length of array = n.
At Iteration 2, Length of array = n⁄2
At Iteration 3, Length of array = (n⁄2)⁄2 = n⁄22