## A more interesting problem is selection: finding the ith smallest element of a set

## We will show:

- A practical randomized algorithm with O(n) expected running time
- A cool algorithm of theoretical interest only with O(n) worst-case running time

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