chapter folders
Ch.2 exercises and notes.

The problem of finding the k-th smallest element of a list is more
challenging than they make it out to be. I chose quickselect with a plan
old random pivot instead of median of medians.

Why is O(nlog(n)) better than O(n)? I'm confused about this.