Question 1 out of 3

    What is the time complexity of a binary search algorithm?

    O(log n)

    The binary search algorithm has a time complexity of O(log n) where n is the number of elements in the array.