Which algorithm design technique is used in the bubble sort algorithm?

Bubble sort uses the algorithm design technique known as "comparison-based sorting." It repeatedly steps through the list to be sorted, compares adjacent elements, and swaps them if they are in the wrong order. This process is repeated until the list is sorted, making it a straightforward but inefficient sorting method, especially for large datasets. The technique primarily relies on simple comparisons and swaps to achieve the sorted order.