fix: fix imports, tests and formatting

Author: alexfertel

src/data_structures/mod.rs

@@ -25,7 +25,6 @@ pub use self::b_tree::BTree;
 pub use self::binary_search_tree::BinarySearchTree;
 pub use self::fenwick_tree::FenwickTree;
 pub use self::graph::{DirectedGraph, UndirectedGraph};
-pub use self::linked_list::LinkedList;
 pub use self::rb_tree::RBTree;
 pub use self::segment_tree::SegmentTree;
 pub use self::stack_using_singly_linked_list::Stack as SllStack;

src/searching/kth_smallest.rs

@@ -1,6 +1,29 @@
-use crate::sorting::partition;
 use std::cmp::{Ordering, PartialOrd};
 
+pub fn partition<T: PartialOrd>(arr: &mut [T], lo: isize, hi: isize) -> isize {
+    let pivot = hi as usize;
+    let mut i = lo - 1;
+    let mut j = hi;
+
+    loop {
+        i += 1;
+        while arr[i as usize] < arr[pivot] {
+            i += 1;
+        }
+        j -= 1;
+        while j >= 0 && arr[j as usize] > arr[pivot] {
+            j -= 1;
+        }
+        if i >= j {
+            break;
+        } else {
+            arr.swap(i as usize, j as usize);
+        }
+    }
+    arr.swap(i as usize, pivot as usize);
+    i
+}
+
 /// Returns k-th smallest element of an array, i.e. its order statistics.
 /// Time complexity is O(n^2) in the worst case, but only O(n) on average.
 /// It mutates the input, and therefore does not require additional space.

src/sorting/mod.rs

@@ -57,7 +57,7 @@ pub use self::insertion_sort::insertion_sort;
 pub use self::merge_sort::merge_sort;
 pub use self::odd_even_sort::odd_even_sort;
 pub use self::pancake_sort::pancake_sort;
-pub use self::quick_sort::{partition, quick_sort};
+pub use self::quick_sort::quick_sort;
 pub use self::radix_sort::radix_sort;
 pub use self::selection_sort::selection_sort;
 pub use self::shell_sort::shell_sort;