Uwe Rösler: FIND Revisited

We discuss the state of the art of the runtime analysis for the algorithm FIND or QUICKSELECT. The novelty is an elegant approach via a contraction argument on the function space $D$ (right continuous functions with existing left limits).

Back to the Index