Professional Documents
Culture Documents
Slides Algo-Asymptotic1 Typed PDF
Slides Algo-Asymptotic1 Typed PDF
Analysis
Big-‐Oh:
Defini(on
Design
and
Analysis
of
Algorithms
I
Big-‐Oh:
English
Defini(on
Let
T(n)
=
func(on
on
n
=
1,2,3,…
[usually,
the
worst-‐case
running
(me
of
an
algorithm]
Tim
Roughgarden
Big-‐Oh:
Formal
Defini(on
Formal
Defini(on
:
T(n)
=
O(f(n))
if
and
only
if
there
exist
constants
such
that
For all
Tim Roughgarden