<s>
In	O
computing	O
,	O
an	O
odd	B-Algorithm
–	I-Algorithm
even	I-Algorithm
sort	I-Algorithm
or	O
odd	O
–	O
even	O
transposition	O
sort	O
(	O
also	O
known	O
as	O
brick	B-Algorithm
sort	I-Algorithm
or	O
parity	O
sort	O
)	O
is	O
a	O
relatively	O
simple	O
sorting	B-Algorithm
algorithm	I-Algorithm
,	O
developed	O
originally	O
for	O
use	O
on	O
parallel	O
processors	O
with	O
local	O
interconnections	O
.	O
</s>
<s>
It	O
is	O
a	O
comparison	B-Algorithm
sort	I-Algorithm
related	O
to	O
bubble	B-Algorithm
sort	I-Algorithm
,	O
with	O
which	O
it	O
shares	O
many	O
characteristics	O
.	O
</s>
<s>
In	O
the	O
Baudet	O
–	O
Stevenson	O
odd	O
–	O
even	O
merge-splitting	O
algorithm	O
,	O
each	O
processor	O
sorts	O
its	O
own	O
sublist	O
at	O
each	O
step	O
,	O
using	O
any	O
efficient	O
sort	B-Algorithm
algorithm	I-Algorithm
,	O
and	O
then	O
performs	O
a	O
merge	O
splitting	O
,	O
or	O
transposition	O
–	O
merge	O
,	O
operation	O
with	O
its	O
neighbor	O
,	O
with	O
neighbor	O
pairing	O
alternating	O
between	O
odd	O
–	O
even	O
and	O
even	O
–	O
odd	O
on	O
each	O
step	O
.	O
</s>
<s>
A	O
related	O
but	O
more	O
efficient	O
sort	B-Algorithm
algorithm	I-Algorithm
is	O
the	O
Batcher	B-Algorithm
odd	I-Algorithm
–	I-Algorithm
even	I-Algorithm
mergesort	I-Algorithm
,	O
using	O
compare	O
–	O
exchange	O
operations	O
and	O
perfect-shuffle	O
operations	O
.	O
</s>
<s>
The	O
single-processor	O
algorithm	O
,	O
like	O
bubblesort	B-Algorithm
,	O
is	O
simple	O
but	O
not	O
very	O
efficient	O
.	O
</s>
<s>
The	O
odd	B-Algorithm
–	I-Algorithm
even	I-Algorithm
sort	I-Algorithm
algorithm	O
correctly	O
sorts	O
this	O
data	O
in	O
passes	O
.	O
</s>
<s>
Since	O
the	O
sorting	B-Algorithm
algorithm	I-Algorithm
only	O
involves	O
comparison-swap	O
operations	O
and	O
is	O
oblivious	O
(	O
the	O
order	O
of	O
comparison-swap	O
operations	O
does	O
not	O
depend	O
on	O
the	O
data	O
)	O
,	O
by	O
Knuth	O
's	O
0	O
–	O
1	O
sorting	B-Algorithm
principle	O
,	O
it	O
suffices	O
to	O
check	O
correctness	O
when	O
each	O
is	O
either	O
0	O
or	O
1	O
.	O
</s>
