bn:00199566n
Noun Concept
Categories: Sorting algorithms, Stable sorts, Comparison sorts, Articles containing proofs
EN
odd–even sort  brick sort  Odd-even Sort  Odd even sort  odd–even transposition sort
EN
In computing, an odd–even sort or odd–even transposition sort is a relatively simple sorting algorithm, developed originally for use on parallel processors with local interconnections. Wikipedia
Definitions
Relations
Sources
EN
In computing, an odd–even sort or odd–even transposition sort is a relatively simple sorting algorithm, developed originally for use on parallel processors with local interconnections. Wikipedia
Sorting algorithm that repeatedly compares all odd/even indexed pairs of adjacent elements in the list, swapping misordered pairs Wikidata