Anson/Go-v-Rust-Quicksort
1
0
Fork 0
mirror of https://gitlab.com/Anson-Projects/anson-stuff/Go-v-Rust-Quicksort.git synced 2025-06-16 06:06:40 +00:00
Code Releases Activity

THE RUST ALGO

Browse Source
This commit is contained in:
Anson 2022-04-25 15:12:22 -07:00
parent 631752f28b
commit 0aa9c50fff
1 changed files with 27 additions and 24 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

51
rust/src/main.rs
View File

@ -3,23 +3,19 @@
use rayon::join;
fn choose_pivot<T: Ord>(slice: &[T]) -> usize {
// if slice.len() <= 2 {return slice.len() - 1;};
let (mut ismall, imid, mut ibig) = (0, slice.len() / 2, slice.len() - 1);
if slice[ibig] < slice[ismall] {
std::mem::swap(&mut ibig, &mut ismall);
let (mut left, mid, mut right) = (0, slice.len() / 2, slice.len() - 1);
if slice[right] < slice[left] {
std::mem::swap(&mut right, &mut left);
}
if slice[imid] <= slice[ismall] {
ismall
} else if slice[ibig] <= slice[imid] {
ibig
if slice[mid] <= slice[left] {
return left;
} else if slice[right] <= slice[mid] {
return right;
} else {
imid
return mid;
}
}
/// choose a pivot, then reorder so that everything to the left of the pivot is smaller, and
/// everything to the right is greater
/// Assumes slice.len() > 2
fn partition<T: Ord>(slice: &mut [T], pivot: usize) -> usize {
let mxix = slice.len() - 1;
slice.swap(pivot, mxix);
@ -52,10 +48,7 @@ fn partition<T: Ord>(slice: &mut [T], pivot: usize) -> usize {
return left + 1;
}
panic!(
"This should be unreachable. Indices: {}, {} / {}",
left, right, mxix
);
panic!("partition failed.")
}
fn quicksort<T: Ord + std::marker::Send>(slice: &mut [T]) {
@ -68,11 +61,10 @@ fn quicksort<T: Ord + std::marker::Send>(slice: &mut [T]) {
return;
}
let pivot = choose_pivot(slice);
let pivot = partition(slice, pivot);
let pivot = partition(slice, choose_pivot(slice));
let (left_slice, right_slice) = slice.split_at_mut(pivot);
let right_slice = &mut right_slice[1..];
let right_slice = &mut right_slice[1..]; // want to exclude pivot
quicksort(left_slice);
quicksort(right_slice);
@ -88,12 +80,9 @@ fn par_quicksort<T: Ord + std::marker::Send>(slice: &mut [T]) {
return;
}
let pivot = choose_pivot(slice);
let pivot = partition(slice, pivot);
let pivot = partition(slice, choose_pivot(slice));
let (left_slice, right_slice) = slice.split_at_mut(pivot);
// left_slice is [0 - pivot-1], right_slice is [pivot, end]. We don't want to include the
// pivot, so reassign right_slice
let right_slice = &mut right_slice[1..];
let right_slice = &mut right_slice[1..]; // want to exclude pivot
join(|| quicksort(left_slice), || quicksort(right_slice));
}
@ -132,3 +121,17 @@ fn qs(b: &mut Bencher) {
b.iter(|| quicksort(&mut test_vec))
}
#[test]
fn qs_comp() {
let bv = get_bench_vec();
let mut par = bv.clone();
let mut basic = bv.clone();
par_quicksort(&mut par);
quicksort(&mut basic);
for (l, r) in par.iter().zip(basic.iter()) {
assert_eq!(l, r)
}
}