O(log n)
← Back to Binary Search
Logarithmic time complexity. The algorithm halves the search space at each step, resulting in a runtime proportional to the logarithm of the input size. Characteristic of binary search and balanced tree operations.
← Back to Binary Search
Logarithmic time complexity. The algorithm halves the search space at each step, resulting in a runtime proportional to the logarithm of the input size. Characteristic of binary search and balanced tree operations.