A sort which relatively passes through a list to exchange the first element with any element less than it and then repeats with a new first element is called ................
A. Insertion sort
B. Selection sort
C. Heap sort
D. Quick sort
Answer:D
A sort which relatively passes through a list to exchange the first element with any element less than it and then repeats with a new first element is called ................
A. Insertion sort B. Selection sort C. Heap sort D. Quick sort