•Therefore,
when analyzing algorithms,
–we
should consider the maximum amount of time that an algorithm can require to
solve a problem of size N -- this is called the worst case.
–Worst
case analysis concludes that your algorithm is O(f(N)) in the worst case.
