Which sorting algorithm moves through a list repeatedly, swapping elements that are in the wrong order?

Which sorting algorithm moves through a list repeatedly, swapping elements that are in the wrong order?

• A. Bubble Sort
• B. Pseudocode
• C. Linear Algorithm
• D. Recursive Algorithm

Answer: (A)

Moving through a list repeatedly and swapping adjacent elements that are out of order describes bubble sort. In this approach, you compare neighboring items and swap them if the left one is larger than the right one. Each pass pushes the largest unsorted value toward the end, so after enough passes the entire list becomes sorted. Pseudocode is just a way to describe algorithms, not a specific sorting method. A linear algorithm refers to procedures that run in linear time, not the particular process of repeated adjacent swaps. A recursive algorithm uses recursion to solve problems, whereas bubble sort is typically described in an iterative way (though it can be implemented recursively as well).

Moving through a list repeatedly and swapping adjacent elements that are out of order describes bubble sort. In this approach, you compare neighboring items and swap them if the left one is larger than the right one. Each pass pushes the largest unsorted value toward the end, so after enough passes the entire list becomes sorted. Pseudocode is just a way to describe algorithms, not a specific sorting method. A linear algorithm refers to procedures that run in linear time, not the particular process of repeated adjacent swaps. A recursive algorithm uses recursion to solve problems, whereas bubble sort is typically described in an iterative way (though it can be implemented recursively as well).