cleanup

Author: AnshulMalik

src/lib.rs

@@ -1,5 +1,5 @@
-mod searching;
-mod sorting;
+pub mod searching;
+pub mod sorting;
 
 #[cfg(test)]
 mod tests {

src/sorting/bubble_sort.rs

@@ -1,4 +1,3 @@
-#[allow(dead_code)]
 pub fn bubble_sort<T: Ord>(arr: &mut [T]) {
     for i in 0..arr.len() {
         for j in 0..arr.len() - 1 - i {

src/sorting/quick_sort.rs

@@ -1,35 +1,24 @@
-extern crate std;
-
-fn _display<T: std::fmt::Display>(arr: &[T]) {
-    print!("\n");
-    for item in arr {
-        print!("{} ", item);
-    }
-}
-
 fn _partition<T: Ord>(arr: &mut [T], lo: isize, hi: isize) -> isize {
-    let pivot: *mut T = &mut arr[hi as usize];
+    let pivot = hi as usize;
     let mut i = lo - 1;
     let mut j = hi;
 
-    unsafe {
-        loop {
+    loop {
+        i += 1;
+        while arr[i as usize] < arr[pivot] {
             i += 1;
-            while arr[i as usize] < *pivot {
-                i += 1;
-            }
+        }
+        j -= 1;
+        while j >= 0 && arr[j as usize] > arr[pivot] {
             j -= 1;
-            while j >= 0 && arr[j as usize] > *pivot {
-                j -= 1;
-            }
-            if i >= j {
-                break;
-            } else {
-                arr.swap(i as usize, j as usize);
-            }
+        }
+        if i >= j {
+            break;
+        } else {
+            arr.swap(i as usize, j as usize);
         }
     }
-    arr.swap(i as usize, hi as usize);
+    arr.swap(i as usize, pivot as usize);
     return i;
 }
 fn _quick_sort<T: Ord>(arr: &mut [T], lo: isize, hi: isize) {
@@ -39,7 +28,6 @@ fn _quick_sort<T: Ord>(arr: &mut [T], lo: isize, hi: isize) {
         _quick_sort(arr, p + 1, hi);
     }
 }
-#[allow(dead_code)]
 pub fn quick_sort<T: Ord>(arr: &mut [T]) {
     let len = arr.len();
     _quick_sort(arr, 0, (len - 1) as isize);