bubble sort
A simple sorting algorithm that repeatedly steps through a list, compares adjacent elements, and swaps them if they are in the wrong order.
Bubble sort has O(n²) complexity, so it is not suitable for large data sets.
Textbooks for beginners often explain bubble sort first.