Chapter 16.1, Problem 7SC

Explanation of Solution

An algorithm that is much slower:

• Both the binary search algorithm and linear search algorithm are used to search an element in the linked list.
• The binary search algorithm takes “$\frac{\text{n}}{\text{2}}$” steps to discover the middle element.
• It takes another “$\frac{\text{n}}{4}$” steps to discover the center element of the subinterval either to the left or right.
• The next progress extracts “$\frac{\text{n}}{8}$” steps