<s>
Slowsort	B-Algorithm
is	O
a	O
sorting	B-Algorithm
algorithm	I-Algorithm
.	O
</s>
<s>
It	O
is	O
a	O
reluctant	O
algorithm	O
based	O
on	O
the	O
principle	O
of	O
multiply	O
and	O
surrender	O
(	O
a	O
parody	O
formed	O
by	O
taking	O
the	O
opposites	O
of	O
divide	B-Algorithm
and	I-Algorithm
conquer	I-Algorithm
)	O
.	O
</s>
<s>
It	O
was	O
published	O
in	O
1984	O
by	O
Andrei	O
Broder	O
and	O
Jorge	O
Stolfi	O
in	O
their	O
paper	O
Pessimal	O
Algorithms	O
and	O
Simplexity	O
Analysis	O
(	O
a	O
parody	O
of	O
optimal	B-General_Concept
algorithms	I-General_Concept
and	O
complexity	O
analysis	O
)	O
.	O
</s>
<s>
Slowsort	B-Algorithm
is	O
a	O
recursive	O
algorithm	O
.	O
</s>
<s>
It	O
sorts	O
in-place	B-Algorithm
.	O
</s>
<s>
An	O
unoptimized	O
implementation	O
in	O
Haskell	B-Language
(	O
purely	O
functional	O
)	O
may	O
look	O
as	O
follows	O
:	O
</s>
<s>
The	O
runtime	O
for	O
Slowsort	B-Algorithm
is	O
.	O
</s>
<s>
Slowsort	B-Algorithm
is	O
therefore	O
not	O
in	O
polynomial	O
time	O
.	O
</s>
<s>
Even	O
the	O
best	O
case	O
is	O
worse	O
than	O
Bubble	B-Algorithm
sort	I-Algorithm
.	O
</s>
