Q30.webp
C

Q30.webp

  • Media owner cute_cat
  • Ngày thêm
Kizspy Question: 30
(Choose 1 answer)
Which of these steps follows the most logical order for a low-to-high sorting algorithm?
A. 1. 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
B. 1. 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
C. 1. 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
D. 1. 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

Thông tin

Category
ITE302c
Thêm bởi
cute_cat
Ngày thêm
Lượt xem
3,593
Lượt bình luận
7
Rating
0.00 star(s) 0 đánh giá

Share this media

Back
Bên trên Bottom