Question
Which data structure or concept is best described as a comparison sort that repeatedly swaps adjacent out-of-order elements?
Select an option. Your answer will be checked instantly.
Correct Answer: A. Bubble Sort
Explanation:
Bubble Sort is a comparison sort that repeatedly swaps adjacent out-of-order elements.
This description distinguishes it from the other choices.
Leave a Reply