In which sorting algorithm are repeated swaps made to bring elements to their correct position, typically visualized like "bubbles" moving up in a fluid?

  • Bubble Sort
  • Insertion Sort
  • Merge Sort
  • Quick Sort
'Bubble Sort' is an elementary sorting algorithm that repeatedly steps through the list, compares adjacent elements, and swaps them if they are in the wrong order. The largest unsorted element "bubbles up" to its correct position.
Add your answer
Loading...

Leave a comment

Your email address will not be published. Required fields are marked *