Function comp_sci::algorithms::quick_sort::quick_sort

pub fn quick_sort<A: Ord>(data: &mut [A])

Efficient sorting against large sets.

This divide-and-conquer sorting algorithm performs O(n log n) in average and best case scenarios, but O(n^2) in the worst case.

Quicksort is often faster in practice than other O(n log n) algorithms due to sequential and localized memory references that work well with modern CPU caches.