Last Updated:
1/7/10 10:14 AM
CSE 2011
Prof. J. Elder
- 11 -
Time Complexity of an
Algorithm
±
O(n
2
):
For any input size n
±
n
0
, the algorithm takes
no more
than
cn
2
time on
every
input.
±
²
(n
2
):
For any input size n
±
n
0
, the algorithm takes
at
least
cn
2
time on
at least one
input.
±
³
(n
2
):
Do both.
The time complexity of an algorithm is
the
largest
time required on
any
input
of size n.
(Worst case analysis.)

This
** preview**
has intentionally

**sections.**

*blurred***to view the full version.**

*Sign up*