Odd–even sort
Sorting algorithm that repeatedly compares all odd/even indexed pairs of adjacent elements in the list, swapping misordered pairs
In computing, an odd–even sort or odd–even transposition sort (also known as brick sort or parity sort) is a relatively simple sorting algorithm, developed originally for use on parallel processors with local interconnections. It is a comparison sort related to bubble sort, with which it shares many characteristics.
Nº Q578580 ★
Common · Knowledge
Odd–even sort
Sorting algorithm that repeatedly compares all odd/even indexed pairs of adjacent elements in the list, swapping misordered pairs
In computing, an odd–even sort or odd–even transposition sort (also known as brick sort or parity sort) is a relatively simple sorting algorithm, developed originally for use on parallel processors with local interconnections. It is a comparison sort related to bubble sort, with which it shares many characteristics.
Last price
—
Floor price
—
7-day median
—
30-day sales
0
30-day range
—
In circulation
0
Price history
median
low – high
sales
No sales in this period
Show table
| Date | median | Low | High | sales |
|---|
Sales history
- Last sale
- —
- 30-day average
- —
- 30-day low
- —
- 30-day high
- —
- Sales 7d
- 0
- Sales 30d
- 0
No sales yet.
Anonymous sales: no buyer or seller shown. Figures count player-to-player sales only.
From Wikipedia
In computing, an odd–even sort or odd–even transposition sort (also known as brick sort or parity sort) is a relatively simple sorting algorithm, developed originally for use on parallel processors with local interconnections. It is a comparison sort related to bubble sort, with which it shares many characteristics. It functions by comparing all odd/even indexed pairs of adjacent elements in the list and swapping pairs where in the wrong order (where the first is larger than the second). The next step repeats this for even/odd indexed pairs (of adjacent elements). Then it alternates between odd/even and even/odd steps until the list is sorted.
Text: Wikipédia, CC BY-SA 4.0. · Image: Nuno Nogueira (Nmnogueira) (CC BY-SA 2.5) ·
Related cards
-
Merge sort
Worst-case optimal stable divide and conquer comparison sorting algorithm
Nº Q189057 ★★★
Not listed
-
Merge-insertion sort
Sorting algorithm
Nº Q56277713 ★
Not listed
-
Bucket sort
Sorting algorithm
Nº Q6787153 ★
Not listed
-
B
Byte-pair encoding
Algorithm for data compression and tokenization that iteratively replaces the most frequent pairs of consecutive bytes or symbols with a new representation
Nº Q860962 ★★
Not listed
-
J
Johnson's algorithm
Algorithm to find shortest paths between all pairs of vertices in a sparse, edge-weighted (possibly negatively), directed graph; uses the Bellman–Ford algorithm to remove negative weights and Dijkstra’s algorithm on the rest
Nº Q2345824 ★
Not listed
-
Pairwise comparison (psychology)
Process of comparing two entities to determine which is preferred
Nº Q1435712 ★
Not listed