1. Let L be a list of size n > 1. Suppose that the elements of L are sorted. If SRH(n) is the minimum number of comparisons needed, in the worst case, by using a comparison-based algorithm to...

1. Let L be a list of size n > 1. Suppose that the elements of L are sorted. If SRH(n) is the minimum number of comparisons needed, in the worst case, by using a comparison-based algorithm to recognize whether an element  is in L, then SRH(n) ≥ log2(n + 1).

2. The binary search algorithm is the optimal worst-case algorithm for solving search problems by using the comparison method.