Show the index values for low, high,
and mid for each step in searching the list L for
the value x using binary search.
x = 99
L = [-20, -12, -4, 1, 7, 44, 45, 46, 58, 67, 99, 145] low | mid | high
0 1 2 3 4 5 6 7 8 9 10 11 ----------------
| |
| |
If you are running selectionSort() on the following list, L:
L = [9, 35, 18, 200, 0, 6, 43, 21]
Which of the following represents L after 3 iterations of
the outer loop in selectionSort()?
A. [0, 6, 9, 18, 21, 35, 43, 200]
B. [0, 6, 9, 200, 18, 35, 43, 21]
C. [0, 9, 35, 18, 200, 6, 43, 21]
D. [0, 6, 9, 35, 200, 18, 43, 21]