Logarithmic time describes runtime growth in relation to input size. Binary search illustrates it: on a sorted array, check the middle value and choose the half that could contain the target. section 1.3.1
Searching by halves
Compare the target with the middle value. If they differ, continue in the half where the target could be; repeat, eliminating half the remaining array each time. This takes O(log N), compared with O(N) for checking entries one by one. section 1.3.1
Figure 1.1 List of categories of time complexity used in algorithm analysis, including constant time O(1), linear time O(N), quadratic time O(N^2), and logarithmic time O(logN). N represents the increasing input size, highlighting the performance differences in time complexities.
Compare logarithmic growth with constant, linear, and quadratic time as input size increases. section 1.3.1




