Question

............. sorts a given list of elements by repeatedly comparing the adjacent elements and swapping them if they are unordered.

• A. Selection Sort
• B. Insertion Sort
• C. Bubble Sort
• D. Merge Sort

Hint:

Bubble Sort is a simple sorting algorithm, but it is not very efficient for large datasets due to its O(n^2) time complexity.

Answer 1

The Correct Option is C

Bubble Sort works by repeatedly comparing adjacent elements in a list and swapping them if they are in the wrong order. This process continues until no more swaps are required, indicating that the list is sorted. Therefore, the correct answer is "Bubble Sort."