Hunt–Szymanski algorithm

The Hunt–Szymanski algorithm is a way of sorting a list of numbers. It's like putting numbers in order, from smallest to biggest. To do this, the algorithm looks at the numbers one by one and looks at the numbers next to it. If the first number is bigger than the next one, it switches them around to make the list in order. Then it looks at the numbers after that, and switches them around if needed. It keeps going through the list, switching numbers if needed, until it's all sorted.