tests and benchmarks for quick n' bubble sort

Author: johannes67890

Cargo.lock

@@ -1,12 +1,12 @@
 [package]
-name = "Sorting-algorithm"
+name = "sorting-algorithm"
 version = "0.1.0"
-edition = "2023"
+edition = "2021"
 
 # See more keys and their definitions at https://doc.rust-lang.org/cargo/reference/manifest.html
 
 [dev-dependencies]
-criterion = "0.3"
+criterion = "0.4"
 
 [[bench]]
 name = "sort_benchmark"

Cargo.toml

@@ -0,0 +1,12 @@
+use criterion::{black_box, criterion_group, criterion_main, Criterion};
+use sorting_algorithm::bubblesort;
+
+fn sort_arrays_benchmark(c: &mut Criterion) {
+    let mut arr = black_box([-2,-7,2,10,20,9]);
+
+    c.bench_function("Bubblesort", |b| b.iter(|| bubblesort(&mut arr)));
+
+}
+
+criterion_group!(benches, sort_arrays_benchmark);
+criterion_main!(benches);

benches/sort_benchmark.rs

@@ -1,24 +1,12 @@
-use std::array;
-
-fn bubblesort(array: &mut [i32]) -> &[i32]{
-   
-    for i in 0..array.len() {
-        for j in 0..array.len() - 1 {
-            if array[j] > array[j + 1] {
-                array.swap(j, j + 1);
+ pub fn bubblesort<T: Ord>(arr: &mut [T]) {
+        let len = arr.len();
+        for i in 0..len {
+            for j in 0..len - i - 1 {
+                if arr[j] > arr[j + 1] {
+                    arr.swap(j, j + 1);
+                }
             }
         }
     }
-    array
-}
 
-mod tests {
-    use super::bubblesort;
 
-    #[test]
-    fn test_bubblesort() {
-        let mut array = [10, 7, 8, 9, 1, 5];
-        let sorted = bubblesort(&mut array);
-        assert_eq!(sorted, &[1, 5, 7, 8, 9, 10]);
-    }
-}

benchmarks/sorting_benchmark.rs

@@ -0,0 +1,22 @@
+mod bubblesort;
+mod quciksort;
+
+pub use bubblesort::bubblesort;
+pub use quciksort::quicksort;
+
+#[cfg(test)]
+mod tests {
+    use super::*;
+    #[test]
+    fn test_bubble_sort() {
+        let mut arr = [6, 2, 4, 1, 9, -2, 5];
+        bubblesort(&mut arr);
+        assert_eq!(arr, [-2, 1, 2, 4, 5, 6, 9]);
+    }
+    #[test]
+    fn test_quick_sort() {
+        let mut array = [10, 7, 8, 9, 1, 5];
+        let sorted = quicksort(&mut array);
+        assert_eq!(sorted, &[1, 5, 7, 8, 9, 10]);
+    }
+}

src/bubblesort.rs

@@ -33,14 +33,3 @@ pub fn quicksort(array: &mut [i32]) -> &[i32] {
 
     array
 }
-
-mod tests {
-    use super::quicksort;
-
-    #[test]
-    fn test_quicksort() {
-        let mut array = [10, 7, 8, 9, 1, 5];
-        let sorted = quicksort(&mut array);
-        assert_eq!(sorted, &[1, 5, 7, 8, 9, 10]);
-    }
-}