20 citations · 20 across the 5 of their papers we have counts for
1 paper · 1 filter
Benjamin Dadoun, Ralph Neininger
In this paper we study the number of key exchanges required by Hoare's FIND algorithm (also called Quickselect) when operating on a uniformly distributed random permutation and sel…