An in-place quicksort. The algorithm is from Sedgewick and Bentley, "Quicksort is Optimal": http://www.cs.princeton.edu/~rs/talks/QuicksortIsOptimal.pdf
(arr: &mut [T], compare: F)
source not stored for this graph (policy: none)
no test coverage detected