Published by Dimitris Kougioumtzis · Updated
Alternate odd and even neighbor comparisons until a full round makes no swaps.
Alternate independent even-starting and odd-starting neighbor comparisons until both parities are ordered.
When to use Odd–even sort
Explaining phase-based local comparison work.
Choosing an alternative
Bubble sort uses overlapping comparisons in a directional sweep.
Worked example: input and state changes
Example input
38, 12, 65, 8, 43, 27, 91, 19
These checkpoints follow the actual example timeline. State details show the stored values and decisions; use the visualization to inspect every intervening step.
Step 0: Initial state.
State at this checkpoint
{ "values": [ 38, 12, 65, 8, 43, 27, 91, 19 ], "active": [] }Step 11: Compare odd pair.
State at this checkpoint
{ "values": [ 12, 8, 38, 65, 27, 43, 19, 91 ], "active": [ 3, 4 ] }Step 21: Compare even pair.
State at this checkpoint
{ "values": [ 8, 12, 27, 38, 19, 65, 43, 91 ], "active": [ 6, 7 ] }Step 32: Compare odd pair.
State at this checkpoint
{ "values": [ 8, 12, 19, 27, 38, 43, 65, 91 ], "active": [ 1, 2 ] }Step 42: Complete: values are in ascending order.
State at this checkpoint
{ "values": [ 8, 12, 19, 27, 38, 43, 65, 91 ], "active": [] }
Expected final state
Complete: values are in ascending order.
Complexity and input bounds
Family: Sorting. Time complexity: O(n²).
Space complexity: O(1) sequential auxiliary space.
Working-space bounds describe algorithm state and any explicitly noted output, excluding the visualization's saved timeline. Recording frames can use more memory than running the function alone. Here n is sequence length, V and E are vertex and edge counts, and other parameters refer to the named input dimensions.
2–24 comma-separated integers between 0 and 99.
The playground validates these limits before starting. Downloaded functions are callable implementations, with parameter and output-buffer contracts in their comments; they do not all repeat the playground's input validation.
Common mistakes and limitations
One swap-free half-phase is not sufficient if the other parity still contains an inversion.
Further reading
For background on algorithm analysis and the JavaScript function interface:
- MIT OpenCourseWare: algorithm design and analysis foundations
- MDN: JavaScript function parameters and return values
Editorial and testing approach · Browse all algorithm guides
Complete JavaScript implementation
1 2 3 4 5 6 7 8 9 10 11 12 13 | // Sorts a in place. n is the array length. Return value 0 indicates completion. Reference snippets assume validated playground inputs. Fixed scratch buffers have 256 slots. Sorting variants may use a different traversal strategy than the animation. function algorithm(a, n) { let changed = 1; while (changed == 1) { changed = 0; for (let parity = 0; parity < 2; parity++) { for (let i = parity; i + 1 < n; i += 2) { if (a[i] > a[i + 1]) { let t = a[i]; a[i] = a[i + 1]; a[i + 1] = t; changed = 1; } } } } return 0; } |
Source
No original paper has been verified for this entry. This source is a reference text or teaching reference, not an asserted original publication.
- The Art of Computer Programming, Volume 3: Sorting and Searching (2nd edition)
Donald E. Knuth (1998). Reference book.