An automated conveyor belt system processes packages. A list of package weights, in kilograms, is sorted in ascending order:
1.2 1.5 2.1 3.0 3.6 4.2 4.7 5.5 6.1 6.8 7.2 8.0 9.5
A binary search algorithm is used with this list to find a target weight of 1.5 kg.
Complete the table to show the three weights in the order that the algorithm would compare them against the target value. Assume that the first element has index 0, the last element has index 12, and the midpoint index is calculated using integer division (rounding down) as mid=floor((low+high)/2)\text{mid} = \text{floor}((\text{low} + \text{high}) / 2)mid=floor((low+high)/2).
| Step | Weight (kg) |
|---|---|
| First | |
| Second | |
| Third | |
| Fourth | 1.5 |