<s>
The	O
cache-oblivious	B-Application
distribution	I-Application
sort	I-Application
is	O
a	O
comparison-based	B-Algorithm
sorting	B-Algorithm
algorithm	I-Algorithm
.	O
</s>
<s>
It	O
is	O
similar	O
to	O
quicksort	B-Algorithm
,	O
but	O
it	O
is	O
a	O
cache-oblivious	B-Application
algorithm	I-Application
,	O
designed	O
for	O
a	O
setting	O
where	O
the	O
number	O
of	O
elements	O
to	O
sort	O
is	O
too	O
large	O
to	O
fit	O
in	O
a	O
cache	B-General_Concept
where	O
operations	O
are	O
done	O
.	O
</s>
<s>
In	O
the	O
external	B-Application
memory	I-Application
model	I-Application
,	O
the	O
number	O
of	O
memory	O
transfers	O
it	O
needs	O
to	O
perform	O
a	O
sort	O
of	O
items	O
on	O
a	O
machine	O
with	O
cache	B-General_Concept
of	O
size	O
and	O
cache	B-General_Concept
lines	O
of	O
length	O
is	O
,	O
under	O
the	O
tall	O
cache	B-General_Concept
assumption	O
that	O
.	O
</s>
<s>
This	O
number	O
of	O
memory	O
transfers	O
has	O
been	O
shown	O
to	O
be	O
asymptotically	O
optimal	O
for	O
comparison	B-Algorithm
sorts	I-Algorithm
.	O
</s>
<s>
The	O
split	O
is	O
done	O
by	O
performing	O
the	O
linear	B-Algorithm
time	I-Algorithm
median	I-Algorithm
finding	I-Algorithm
algorithm	O
,	O
and	O
partitioning	O
based	O
on	O
this	O
median	O
.	O
</s>
<s>
Though	O
this	O
correctly	O
distributes	O
all	O
elements	O
,	O
it	O
does	O
not	O
exhibit	O
a	O
good	O
cache	B-General_Concept
performance	O
.	O
</s>
