<s>
In	O
computer	B-General_Concept
science	I-General_Concept
,	O
the	O
ostrich	B-Operating_System
algorithm	I-Operating_System
is	O
a	O
strategy	O
of	O
ignoring	O
potential	O
problems	O
on	O
the	O
basis	O
that	O
they	O
may	O
be	O
exceedingly	O
rare	O
.	O
</s>
<s>
This	O
approach	O
may	O
be	O
used	O
in	O
dealing	O
with	O
deadlocks	B-Operating_System
in	O
concurrent	B-Architecture
programming	I-Architecture
if	O
they	O
are	O
believed	O
to	O
be	O
very	O
rare	O
and	O
the	O
cost	O
of	O
detection	O
or	O
prevention	O
is	O
high	O
.	O
</s>
<s>
For	O
example	O
,	O
if	O
each	O
PC	O
deadlocks	B-Operating_System
once	O
per	O
10	O
years	O
,	O
a	O
single	O
reboot	O
may	O
be	O
less	O
painful	O
than	O
the	O
restrictions	O
needed	O
to	O
prevent	O
it	O
.	O
</s>
<s>
The	O
ostrich	B-Operating_System
algorithm	I-Operating_System
pretends	O
there	O
is	O
no	O
problem	O
and	O
is	O
reasonable	O
to	O
use	O
if	O
deadlocks	B-Operating_System
occur	O
very	O
rarely	O
and	O
the	O
cost	O
of	O
their	O
prevention	O
would	O
be	O
high	O
.	O
</s>
<s>
The	O
UNIX	B-Application
and	O
Windows	O
operating	O
systems	O
take	O
this	O
approach	O
.	O
</s>
<s>
Although	O
using	O
the	O
ostrich	B-Operating_System
algorithm	I-Operating_System
is	O
one	O
of	O
the	O
methods	O
of	O
dealing	O
with	O
deadlocks	B-Operating_System
,	O
other	O
effective	O
methods	O
exist	O
such	O
as	O
dynamic	O
avoidance	O
,	O
banker	B-Operating_System
's	I-Operating_System
algorithm	I-Operating_System
,	O
detection	O
and	O
recovery	O
,	O
and	O
prevention	O
.	O
</s>
<s>
Although	O
efficient	O
,	O
using	O
the	O
Ostrich	B-Operating_System
algorithm	I-Operating_System
trades	O
correctness	O
for	O
convenience	O
.	O
</s>
<s>
In	O
fact	O
,	O
the	O
simplest	O
and	O
most	O
used	O
method	O
to	O
recover	O
from	O
a	O
deadlock	B-Operating_System
is	O
a	O
reboot	O
.	O
</s>
<s>
Some	O
algorithms	O
with	O
poor	O
worst-case	O
performance	O
are	O
commonly	O
used	O
because	O
they	O
only	O
exhibit	O
poor	O
performance	O
on	O
artificial	O
cases	O
that	O
do	O
not	O
occur	O
in	O
practice	O
;	O
typical	O
examples	O
are	O
the	O
simplex	B-Algorithm
algorithm	I-Algorithm
and	O
the	O
type-inference	O
algorithm	O
for	O
Standard	B-Language
ML	I-Language
.	O
</s>
<s>
Quicksort	B-Algorithm
is	O
a	O
sorting	O
algorithm	O
widely	O
accepted	O
as	O
the	O
fastest	O
comparison	O
based	O
sorting	O
algorithm	O
has	O
worst	O
case	O
performance	O
on	O
par	O
with	O
bubblesort	O
which	O
is	O
widely	O
regarded	O
as	O
one	O
of	O
the	O
worst	O
sorting	O
algorithms	O
,	O
but	O
this	O
behavior	O
is	O
expected	O
to	O
occur	O
only	O
very	O
rarely	O
on	O
certain	O
types	O
of	O
input	O
.	O
</s>
<s>
Issues	O
like	O
integer	B-Error_Name
overflow	I-Error_Name
in	O
programming	O
languages	O
with	O
fixed-width	O
integers	O
are	O
also	O
frequently	O
ignored	O
because	O
they	O
occur	O
only	O
in	O
exceptional	O
cases	O
that	O
do	O
not	O
arise	O
for	O
practical	O
inputs	O
.	O
</s>
