## What will be the worst case for the algorithm?

- Partition is always unbalanced
- One subarray is size n - 1, the other is size 1
- This happens when q = p

- Partition is always unbalanced

## What will be the best case for the algorithm?

## Which is more likely?

## Will any particular input elicit the worst case?

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