fn quick_sort(arr: &mut arr[u32]) {
let len = arr.len();
if len <= 1 {
return;
}
let pivot_index = partition(arr);
quick_sort(&mut arr[0, pivot_index]);
quick_sort(&mut arr[pivot_index + 1, len]);
}
fn partition(arr: &mut arr[u32]) -> usize {
let len = arr.len();
let pivot_index = len / 2;
arr.swap(pivot_index, len - 1);
let mut i = 0;
for j in 0.. len - 1 {
if arr[j] < arr[len - 1] {
arr.swap(j, i);
i += 1;
}
}
arr.swap(i, len - 1);
i
}
rust快速排序
最新推荐文章于 2024-07-14 19:56:17 发布