remove own random array function

Author: johannes67890

benches/sort_benchmark.rs

@@ -1,10 +1,6 @@
 use criterion::{criterion_group, criterion_main, BenchmarkId, Criterion, BatchSize};
 use rand::{distributions::Uniform, Rng};
-use sorting_algorithm::bubblesort;
-use sorting_algorithm::mergesort;
-use sorting_algorithm::quicksort;
-use sorting_algorithm::insertionsort;
-use sorting_algorithm::shellsort;
+use sorting_algorithm::{bubblesort, insertionsort, mergesort, quicksort, shellsort};
 
 fn sorting_benchmarks(c: &mut Criterion) {
     let mut group = c.benchmark_group("Sorting Algorithms");

src/lib.rs

@@ -10,41 +10,9 @@ pub use insertion_sort::insertionsort;
 pub use merge_sort::mergesort;
 pub use shell_sort::shellsort;
 
-use rand::Rng;
-use std::{ops::Range, ops::RangeBounds, ops::Bound};
-pub fn generate_random_array(range: Range<u32>, size: u32) -> Vec<u32> {
-    match (range.start_bound(), range.end_bound()){
-        (Bound::Included(start), Bound::Excluded(end)) => { // TODO: should only be included
-            if start >= end {
-                panic!("Start bound must be less than end bound"); // 3..0
-            }
-        },
-        _=> panic!("Unsupported rangebound") // marcro: unimplemented!() (Error if chase is not covered)
-    }
-
-    let mut arr: Vec<u32> = Vec::with_capacity(size as usize);
-    
-    let mut rng = rand::thread_rng();
-
-    for _ in 0..size {
-        arr.push(rng.gen_range(range.clone()));
-    }
-    
-    arr
-}
-
-
 #[cfg(test)]
 mod tests {
     use super::*;
-
-    /// Unit tests for generate_random_array
-    #[test]
-    fn test_generate_random_array(){
-        let arr = generate_random_array(0..100, 1000);
-        assert_eq!(arr.len(), 1000);
-    }
-
     ///
     /// Test sorting algorithms
     ///