Bubble Sort

What Is It?

• Bubble Sort compares pairs of adjacent elements in an array.

• If an element is larger than the one next to it, they swap places.

• This process repeats, pass by pass, until the entire array is sorted.

• In each pass, the biggest element among the unsorted portion moves (or “bubbles”) to its correct position at the end.

Key Points

• Easy to understand but not the most efficient for large data sets.

• Worst-case time complexity: O(n²).

Bubble Sort: Step by Step

Idea: In Bubble Sort, we compare pairs of numbers and swap them if they are out of order. After each pass, the largest number among the unplaced elements “bubbles” to its correct position at the end.