Lecture 6 Order Statistics

Given n elements in array, find kth smallest element (element of rank k)

Worst-case linear time order statistics --by Blum, Floyd, Pratt, Rivest, Tarjan

--idea: generate good pivot recursively.

Not so hot, because the constant is pretty big.