Function rudac::algo::sort::quick_sort

pub fn quick_sort<T: Ord>(slice: &mut [T])

Quicksort is an efficient sorting algorithm

Arguments

• slice: slice of data to be sorted

Examples

use rudac::algo::sort::quick_sort;
 
let mut vec = vec![10, 6, 1, 4, 2, 3, 7, 9, 8, 5];
 
quick_sort(&mut vec);
 
assert_eq!(vec, vec![1, 2, 3, 4, 5, 6, 7, 8, 9, 10]);