O(log n) Logarithmic
← Back to Common Classes
Logarithmic time complexity. The algorithm halves the problem size at each step. Examples include binary search, balanced BST operations, and binary exponentiation. Very efficient even for large inputs.
← Back to Common Classes
Logarithmic time complexity. The algorithm halves the problem size at each step. Examples include binary search, balanced BST operations, and binary exponentiation. Very efficient even for large inputs.