The ______ compares adjacent items and exchanges them if they are out of order.
A)selection sort
B)binary search
C)bubble sort
D)quicksort

Question

Quizplus · Accepted Answer

The bubble sort algorithm compares adjacent items and swaps them if they are out of order, repeatedly iterating through the list until no more swaps are needed. This sorting technique is simple to implement and is best suited for small datasets, making it a popular choice for educational purposes. However, it has a time complexity of O(n^2), which makes it inefficient for sorting large datasets.

The ______ Compares Adjacent Items and Exchanges Them If They