## We say InsertionSort’s run time is ?(n)

## In general a function

- f(n) is ?(g(n)) if ? positive constants c and n0 such that 0 ? c?g(n) ? f(n) ? n ? n0

## Proof:

- Suppose run time is an + b
- Assume a and b are positive (what if b is negative?)

- an ? an + b

- Suppose run time is an + b

Previous slide | Next slide | Back to first slide | View graphic version |