Bubble Sort repeatedly steps through the list, compares adjacent elements, and swaps them if they are in the wrong order. This pass is repeated until the list is sorted.

Run nested loops. Compare adjacent cells: if left > right, swap. After each inner loop pass, the largest unsorted element bubbles up to the end.