Question

The _________ search algorithm requires that the array’s contents be sorted.

Short answer

Answer: Binary Search Algorithm

Step-by-step solution

Identify the search algorithm

The search algorithm that requires the array's contents to be sorted is the "Binary Search Algorithm." Now, let's break down the binary search algorithm in a step-by-step manner.

Understand the Binary Search Algorithm

Binary search algorithm is an efficient search algorithm that works by repeatedly dividing in half the portion of the array that could contain the target value. At each step, the algorithm compares the middle element of the remaining array to the target value. If the middle element is equal to the target value, then the search is successful. If the middle element is less than the target value, then the algorithm searches the right half of the remaining array. If the middle element is greater than the target value, then the algorithm searches the left half of the remaining array.

Initialize the variables

To implement the binary search algorithm, initialize the variables `left`, `right`, and `middle`. Set `left` to 0, and `right` to the length of the array minus 1. The variable `middle` will be calculated at each step of the algorithm.

Binary search loop

Create a loop that will continue until the `left` index is greater than the `right` index. Inside the loop, calculate the middle index as the average of the `left` and `right` indices, rounded down. If the middle element of the array is equal to the target value, the search is successful, and the loop should be terminated. If the middle element is less than the target value, set the `left` index to `middle + 1`. If the middle element is greater than the target value, set the `right` index to `middle - 1`.

Return the result

After the loop ends, if a match is found, return the index of the middle element. If a match is not found, return -1, indicating that the target value is not in the array. Following these steps, you can successfully implement and understand the binary search algorithm, which requires that the array's contents be sorted.