odd–even sort
sorting algorithm that repeatedly compares all odd/even indexed pairs of adjacent elements in the list, swapping misordered pairs
Facts
8 properties- Instance of
- sorting algorithm
- Has use
- parallel algorithm[3]
- Best-case time complexity
- O(n)[7]
- Discoverer or inventor
- Nico Habermann[2]
- Time of discovery or invention
- 1972[4]
- Worst-case space complexity
- O(1)[8]
- Worst-case time complexity
- O(n^2)[6]
🏷️ Also known as
en brick sort
en odd–even sort
en odd–even transposition sort
en parity sort
ar فرز فردي وزوجي
es Ordenacion impar-par
es Ordenación impar-par
fa مرتبسازی زوج و فرد
fr tri pair-impair par transposition
fr tri pair-impair
hi विषम-सम क्रमबद्ध
it Odd-even sort
ja 奇偶転置ソート
ko 홀짝 정렬
ru сортировка чёт-нечет
ru чётно-нечётная сортировка
th การเรียงลำดับคี่–คู่
uk odd-even sort
zh 奇偶排序
🔖 Identifiers · 3
- Image (Wikimedia Commons)
- Odd even sort animation.gif ↗
- Freebase ID
- /m/02qqms1
- Microsoft Academic ID (discontinued)
- 136122759
🔗 Connections
Discoverer or inventor 1
Has use 1
Instance of 1
Uses 1
← FactGrid item ID 1
Press Enter · cited answer in seconds
0 sources
Summary
odd–even sort is a sorting algorithm[1].