ITE302cXuất hiện trong 1 đề thi
Which of these steps follows the most logical order for a low-to-high sorting algorithm?
Các lựa chọn
A1. Scan to find the smallest number
2. Set to 0 in the index in the output array
3. Remove that number from the input array
B1. Scan to find the smallest number
2. Set the length of the array in the index in the output array
3. Remove that number from the input
4. Repeat steps 1-3, but add 1 to the index number for each loop
C1. Scan to find the smallest number
2. Set to 0 in the index in the output array
3. Remove that number from the input array
4. Repeat steps 1-3, but add 1 to the index number for each loop
D1. Scan to find the largest number
2. Set to 0 in the index in the output array
3. Remove that number from the input array
4. Repeat steps 1-3, but add 1 to the index number for each loop