Odd-Even Sort

Odd-even sort, also known as odd-even transposition sort, brick sort, or parity sort, is a comparison-based sorting algorithm related to bubble sort, originally developed for parallel processors with local interconnections. It works by comparing all odd-indexed pairs of adjacent elements and swapping any pair found out of order, then repeating the comparison on even-indexed pairs, alternating between the two passes until the list is sorted.