The ________ sort usually performs more exchanges than the ________ sort.
A) bubble, selection
B) selection, bubble
C) binary, linear
D) linear, binary
E) linear, bubble

Question

Quizplus · Accepted Answer

The bubble sort algorithm works by repeatedly swapping adjacent elements if they are in the wrong order. This means that in the worst case, where the array is in reverse order, the bubble sort performs n*(n-1)/2 swaps, which is more than the selection sort algorithm. The selection sort algorithm, on the other hand, works by repeatedly finding the minimum element from the unsorted portion of the array and putting it at the beginning. This requires n-1 swaps at most, which is less than the bubble sort. Therefore, the correct answer is A.

The ________ Sort Usually Performs More Exchanges Than the ________

The Sort Usually Performs More Exchanges Than the