<s>
In	O
analysis	B-General_Concept
of	I-General_Concept
algorithms	I-General_Concept
,	O
probabilistic	B-General_Concept
analysis	I-General_Concept
of	I-General_Concept
algorithms	I-General_Concept
is	O
an	O
approach	O
to	O
estimate	O
the	O
computational	B-General_Concept
complexity	I-General_Concept
of	O
an	O
algorithm	O
or	O
a	O
computational	O
problem	O
.	O
</s>
<s>
This	O
approach	O
is	O
not	O
the	O
same	O
as	O
that	O
of	O
probabilistic	B-General_Concept
algorithms	I-General_Concept
,	O
but	O
the	O
two	O
may	O
be	O
combined	O
.	O
</s>
<s>
For	O
non-probabilistic	O
,	O
more	O
specifically	O
deterministic	B-General_Concept
,	O
algorithms	O
,	O
the	O
most	O
common	O
types	O
of	O
complexity	O
estimates	O
are	O
the	O
average-case	B-General_Concept
complexity	O
and	O
the	O
almost-always	O
complexity	O
.	O
</s>
<s>
To	O
obtain	O
the	O
average-case	B-General_Concept
complexity	O
,	O
given	O
an	O
input	O
distribution	O
,	O
the	O
expected	O
time	O
of	O
an	O
algorithm	O
is	O
evaluated	O
,	O
whereas	O
for	O
the	O
almost-always	O
complexity	O
estimate	O
,	O
it	O
is	O
evaluated	O
that	O
the	O
algorithm	O
admits	O
a	O
given	O
complexity	O
estimate	O
that	O
almost	O
surely	O
holds	O
.	O
</s>
<s>
In	O
probabilistic	B-General_Concept
analysis	I-General_Concept
of	O
probabilistic	O
(	O
randomized	O
)	O
algorithms	O
,	O
the	O
distributions	O
or	O
average	O
of	O
all	O
possible	O
choices	O
in	O
randomized	O
steps	O
is	O
also	O
taken	O
into	O
account	O
,	O
in	O
addition	O
to	O
the	O
input	O
distributions	O
.	O
</s>
