Bubble Sort

Explanation

- **Bubble Sort** is a simple comparison-based sorting algorithm that repeatedly steps through the list, compares adjacent elements, and swaps them if they are in the wrong order. The process is repeated until the list is sorted.

-

• Steps:

  • Traverse the list, compare adjacent elements, and swap them if they are in the wrong order.
  • After each pass, the largest unsorted element is “bubbled” to the end.
  • Repeat until no more swaps are needed.

• Time Complexity:

  • Best Case: O(n) (when the list is already sorted).
  • Average and Worst Case: O(n^2).