Odd-Even Sort is a parallel-friendly sorting algorithm that repeatedly compares and swaps adjacent elements in alternating odd and even phases until the array is sorted.
Paradigm
Comparison / Parallel-Friendly
Author
Bose & Nelson
Tier
Time Complexity
Best
Avg
Worst
Space
O(1)
Properties