Which sort repeatedly compares adjacent elements and swaps them if unordered?

1. One sort works purely on neighbouring pairs. 2. Larger values drift upward through the list. 3. Bubble sort compares adjacent elements and swaps them if they are unordered. 4. So the answer is bubble sort. _Source: syllabus Computer Science, Ch 5 'Sorting' and Ch 6 'Searching'_