<s>
An	O
internal	B-Algorithm
sort	I-Algorithm
is	O
any	O
data	O
sorting	B-Algorithm
process	O
that	O
takes	O
place	O
entirely	O
within	O
the	O
main	O
memory	O
of	O
a	O
computer	O
.	O
</s>
<s>
This	O
issue	O
has	O
implications	O
for	O
different	O
sort	B-Algorithm
algorithms	I-Algorithm
.	O
</s>
<s>
Some	O
common	O
internal	B-Algorithm
sorting	I-Algorithm
algorithms	O
include	O
:	O
</s>
<s>
Consider	O
a	O
Bubblesort	B-Algorithm
,	O
where	O
adjacent	O
records	O
are	O
swapped	O
in	O
order	O
to	O
get	O
them	O
into	O
the	O
right	O
order	O
,	O
so	O
that	O
records	O
appear	O
to	O
“	O
bubble	O
”	O
up	O
and	O
down	O
through	O
the	O
dataspace	O
.	O
</s>
<s>
On	O
the	O
other	O
hand	O
,	O
some	O
algorithms	O
handle	O
external	B-Algorithm
sorting	I-Algorithm
rather	O
better	O
.	O
</s>
<s>
A	O
Merge	B-Algorithm
sort	I-Algorithm
breaks	O
the	O
data	O
up	O
into	O
chunks	O
,	O
sorts	O
the	O
chunks	O
by	O
some	O
other	O
algorithm	O
(	O
maybe	O
bubblesort	B-Algorithm
or	O
Quick	B-Algorithm
sort	I-Algorithm
)	O
and	O
then	O
recombines	O
the	O
chunks	O
two	O
by	O
two	O
so	O
that	O
each	O
recombined	O
chunk	O
is	O
in	O
order	O
.	O
</s>
<s>
This	O
approach	O
minimises	O
the	O
number	O
or	O
reads	O
and	O
writes	O
of	O
data-chunks	O
from	O
disk	O
,	O
and	O
is	O
a	O
popular	O
external	B-Algorithm
sort	I-Algorithm
method	O
.	O
</s>
