A simple sorting algorithm that repeatedly steps through the list, compares adjacent elements, and swaps them if they are in the wrong order. Time complexity: O(n^2). Rarely used in practice but valuable as a teaching tool. (Ch. 23)