Bubble Sort

Bubble sort is one of the simplest sorting algorithms. It works by repeatedly stepping through the list, comparing adjacent (neighbouring) pairs of elements, and swapping them if they are in the wrong order. This process is repeated until the list is sorted.

The name "bubble sort" comes from the way the largest values "bubble up" to the end of the list with each pass.

---

How Bubble Sort Works

1. Start at the beginning of the list.
2. Compare the first two adjacent elements.
3. If the first element is greater than the second, swap them.
4. Move to the next pair of adjacent elements and repeat the comparison and swap.
5. Continue until you reach the end of the list — this completes one pass.
6. After each pass, the largest unsorted element is in its correct position at the end.
7. Repeat the passes until a complete pass is made with no swaps — the list is now sorted.

---

Pseudocode for Bubble Sort