odd–even sort

Summary

odd–even sort is a sorting algorithm^[1]. It draws 63 Wikipedia views per month (sorting_algorithm category, ranking #18 of 29).^[2]

Key Facts

• odd–even sort is credited with the discovery of Nico Habermann^[3].
• odd–even sort's image is recorded as Odd even sort animation.gif^[4].
• odd–even sort's instance of is recorded as sorting algorithm^[5].
• odd–even sort's has use is recorded as parallel algorithm^[6].
• odd–even sort's time of discovery or invention is recorded as +1972-00-00T00:00:00Z^[7].
• odd–even sort's Freebase ID is recorded as /m/02qqms1^[8].
• odd–even sort's uses is recorded as array data structure^[9].
• odd–even sort's worst-case time complexity is recorded as O(n^2)^[10].
• odd–even sort's best-case time complexity is recorded as O(n)^[11].
• odd–even sort's worst-case space complexity is recorded as O(1)^[12].
• odd–even sort's Microsoft Academic ID is recorded as 136122759^[13].

Body

Designation and Status

odd–even sort's instance of is recorded as sorting algorithm^[5].

Why It Matters

odd–even sort draws 63 Wikipedia views per month (sorting_algorithm category, ranking #18 of 29).^[2] It has Wikipedia articles in 13 language editions, a strong signal of global cultural recognition.^[14] It is known by 7 alternative names across languages and contexts.^[15]