Which algorithm sorts by repeatedly comparing adjacent elements and swapping when out of order?

Which algorithm sorts by repeatedly comparing adjacent elements and swapping when out of order?

• A. Commit
• B. Bubble Sort
• C. Client-Side Programming
• D. Clone

Answer: (B)

Understanding how a simple sorting technique operates on adjacent items is being tested. The algorithm that sorts by repeatedly comparing adjacent elements and swapping when they are out of order is bubble sort. In bubble sort, you walk through the list, compare each pair of neighboring elements, and swap them if the left one is greater than the right one. With each full pass, the largest remaining element moves toward the end of the list, so subsequent passes deal with a smaller portion of the array. After enough passes, the entire list is sorted. The other options aren’t sorting algorithms—they refer to committing changes, client-side programming, or cloning—so they don’t describe a method for ordering elements. Bubble sort is a basic, easy-to-understand example that demonstrates the adjacent-swap idea.

Understanding how a simple sorting technique operates on adjacent items is being tested. The algorithm that sorts by repeatedly comparing adjacent elements and swapping when they are out of order is bubble sort. In bubble sort, you walk through the list, compare each pair of neighboring elements, and swap them if the left one is greater than the right one. With each full pass, the largest remaining element moves toward the end of the list, so subsequent passes deal with a smaller portion of the array. After enough passes, the entire list is sorted. The other options aren’t sorting algorithms—they refer to committing changes, client-side programming, or cloning—so they don’t describe a method for ordering elements. Bubble sort is a basic, easy-to-understand example that demonstrates the adjacent-swap idea.