A sort which compares adjacent elements in a list and switches where necessary is

The sort you're referring to is known as a Bubble Sort. Here's how it works, step by step:

1. Start at the beginning of the list.
2. Compare the first and second elements. If the first element is larger than the second, swap them.
3. Move to the next pair of elements (second and third). Again, if the first in the pair is larger than the second, swap them.
4. Continue this process for each pair of adjacent elements in the list.
5. Once you've gone through the entire list, if you had to make any swaps, start over again from the beginning.
6. Repeat this

The sort you're referring to is known as a Bubble Sort. Here's how it works, step by step:

1. Start at the beginning of the list.
2. Compare the first and second elements. If the first element is larger than the second, swap them.
3. Move to the next pair of elements (second and third). Again, if the first in the pair is larger than the second, swap them.
4. Continue this process for each pair of adjacent elements in the list.
5. Once you've gone through the entire list, start again from the beginning.
6. Repeat these steps until you can go through the entire list without having to make any swaps. At this point, the list is sorted.

This is a simple sorting algorithm, but it's not very efficient for large lists. It's called a "bubble sort" because with each iteration through the list, the largest unsorted element "bubbles up" to its correct position.