In General, If L Is a Sorted List of Size

question 32

True/False

In general, if L is a sorted list of size n, to determine whether an element is in L, the binary search makes at most 2 * log₂n + 2 key (item) comparisons.