Which sorting algorithm sorts by comparing adjacent elements?

Which sorting algorithm sorts by comparing adjacent elements?

• A. Branch
• B. Connection Pool
• C. Bubble Sort
• D. Clone

Answer: (C)

The question tests understanding of a sorting method that relies on pairwise comparisons of neighboring items. In bubble sort, you repeatedly scan the list, compare each adjacent pair, and swap them if they’re out of order. This pushes larger elements toward the end with each pass, so after enough passes the entire list is sorted. It’s a simple, intuitive approach that directly embodies the idea of sorting by comparing adjacent elements. Other options don’t describe a sorting method: one refers to a control path in code (branch), another to managing connections (connection pool), and another to duplicating objects (clone). They aren’t about sorting by adjacent comparisons, which is why the method that performs those adjacent comparisons and swaps is the correct choice.

The question tests understanding of a sorting method that relies on pairwise comparisons of neighboring items. In bubble sort, you repeatedly scan the list, compare each adjacent pair, and swap them if they’re out of order. This pushes larger elements toward the end with each pass, so after enough passes the entire list is sorted. It’s a simple, intuitive approach that directly embodies the idea of sorting by comparing adjacent elements.

Other options don’t describe a sorting method: one refers to a control path in code (branch), another to managing connections (connection pool), and another to duplicating objects (clone). They aren’t about sorting by adjacent comparisons, which is why the method that performs those adjacent comparisons and swaps is the correct choice.