O(log n)
Term side of the Card
Topic: Complexity Analysis
Unit title: O(log n)
Categories: Concept
Explanation side of the Card
Explanation: The complexity class where execution time grows logarithmically as input size increases. Commonly seen in binary search and other divide-and-conquer algorithms.