<s>
Strand	B-Algorithm
sort	I-Algorithm
is	O
a	O
recursive	O
sorting	B-Algorithm
algorithm	I-Algorithm
that	O
sorts	O
items	O
of	O
a	O
list	O
into	O
increasing	O
order	O
.	O
</s>
<s>
This	O
algorithm	O
is	O
called	O
strand	B-Algorithm
sort	I-Algorithm
because	O
there	O
are	O
strands	O
of	O
sorted	O
elements	O
within	O
the	O
unsorted	O
elements	O
that	O
are	O
removed	O
one	O
at	O
a	O
time	O
.	O
</s>
<s>
Since	O
Strand	B-Algorithm
Sort	I-Algorithm
requires	O
many	O
insertions	O
and	O
deletions	O
,	O
it	O
is	O
best	O
to	O
use	O
a	O
linked	O
list	O
when	O
implementing	O
the	O
algorithm	O
.	O
</s>
