In a(n) ____, the number of comparisons made in each pass is one less than the number of elements remaining to be sorted because an element must be compared with the element next to it.
A) selection sort
B) heap sort
C) bubble sort
D) insertion sort

Question

Quizplus · Accepted Answer

In a bubble sort algorithm, during each pass through the array, elements are compared pairwise and swapped if they are in the wrong order. This process is repeated until the array is sorted. With each pass, the largest unsorted element "bubbles up" to its correct position at the end of the array, reducing the number of comparisons needed in the next pass by one.

In A(n) ____, the Number of Comparisons Made in Each