Question

What is computing time for binary search?

Answer 1

Here is your answer........Binary search runs in at worst logarithmic time, making O (log n) comparisons,where n is the number of elements in the array,the O is big O notation, and log is the logarithm. Binary search takes constant (O (1)) space,meaning that the space taken by the algorithm is the same for any number of elements in the array.
(I hope this helps you )