Question:

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

Show 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.
Updated On: Apr 24, 2025
  • Selection Sort
  • Insertion Sort
  • Bubble Sort
  • Merge Sort
Hide Solution
collegedunia
Verified By Collegedunia

The Correct Option is C

Solution and Explanation

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."
Was this answer helpful?
0
0

Questions Asked in CUET exam

View More Questions