Add the rayon_sorted_reverse algorithm

benches/job_scheduling.rs

@@ -8,6 +8,7 @@ const TEST_FUNCS: &[(&str, &dyn Fn(&[Task]))] = &[
 	("single thread", &single_thread),
 	("rayon", &rayon),
 	("rayon sorted", &rayon_sorted),
+	("rayon sorted reverse", &rayon_sorted_reverse),
 ];
 
 fn job_scheduling_benchmark(c: &mut Criterion) {

src/algorithm/rayon.rs

@@ -7,6 +7,14 @@ pub fn rayon(data: &[Task]) {
 
 pub fn rayon_sorted(data: &[Task]) {
 	let mut data = data.to_vec();
+	// Shortest tasks first
 	data.sort();
-	rayon(&data)
+	rayon(&data);
+}
+
+pub fn rayon_sorted_reverse(data: &[Task]) {
+	let mut data = data.to_vec();
+	// Longest tasks first
+	data.sort_by(|a, b| a.cmp(b).reverse());
+	rayon(&data);
 }