A bubble sort requires at most ______ passes to sort an array of n items.
A)n/2
B)n - 2
C)n - 1
D)n

Question

Quizplus · Accepted Answer

A bubble sort compares adjacent elements and swaps them if they are in the wrong order, so it will take n - 1 passes to bring the largest element to its correct position at the end of the array. Once the largest element is in place, the algorithm will perform n - 2 comparisons to bring the next largest element to its correct position. This process continues until all elements are sorted, meaning a total of n - 1 passes are required. Therefore, the best choice is C.

A Bubble Sort Requires at Most ______ Passes to Sort