Example 2: Insertion Sort

Again, we might know that

f(n) = c1n2 + c2n + c3

However, the performance is highly data dependent.

For each instance size, we might generate best-case, worst-case, and random data.

Previous slide

Next slide

Back to first slide

View graphic version