Add Exchange Sort (TheAlgorithms#318)

Author: merelymyself

README.md

@@ -13,6 +13,7 @@ These are for demonstration purposes only.
 - [x] [Cocktail-Shaker](./src/sorting/cocktail_shaker_sort.rs)
 - [x] [Counting](./src/sorting/counting_sort.rs)
 - [x] [Cycle](./src/sorting/cycle_sort.rs)
+- [x] [Exchange](./src/sorting/exchange_sort.rs)
 - [x] [Heap](./src/sorting/heap_sort.rs)
 - [x] [Insertion](./src/sorting/insertion_sort.rs)
 - [x] [Gnome](./src/sorting/gnome_sort.rs)

src/sorting/exchange_sort.rs

@@ -0,0 +1,33 @@
+// sorts through swapping the first value until it is at the right position, and repeating for all the following.
+
+pub fn exchange_sort(arr: &mut [i32]) {
+    let length = arr.len();
+    for number1 in 0..length {
+        for number2 in (number1 + 1)..length {
+            if arr[number2] < arr[number1] {
+                arr.swap(number1, number2)
+            }
+        }
+    }
+}
+
+#[cfg(test)]
+mod tests {
+    use super::super::is_sorted;
+    use super::*;
+    #[test]
+    fn it_works() {
+        let mut arr1 = [6, 5, 4, 3, 2, 1];
+        exchange_sort(&mut arr1);
+        assert!(is_sorted(&arr1));
+        arr1 = [12, 343, 21, 90, 3, 21];
+        exchange_sort(&mut arr1);
+        assert!(is_sorted(&arr1));
+        let mut arr2 = [1];
+        exchange_sort(&mut arr2);
+        assert!(is_sorted(&arr2));
+        let mut arr3 = [213, 542, 90, -23412, -32, 324, -34, 3324, 54];
+        exchange_sort(&mut arr3);
+        assert!(is_sorted(&arr3));
+    }
+}

src/sorting/mod.rs

@@ -4,6 +4,7 @@ mod cocktail_shaker_sort;
 mod comb_sort;
 mod counting_sort;
 mod cycle_sort;
+mod exchange_sort;
 mod gnome_sort;
 mod heap_sort;
 mod insertion_sort;
@@ -24,6 +25,7 @@ pub use self::comb_sort::comb_sort;
 pub use self::counting_sort::counting_sort;
 pub use self::counting_sort::generic_counting_sort;
 pub use self::cycle_sort::cycle_sort;
+pub use self::exchange_sort::exchange_sort;
 pub use self::gnome_sort::gnome_sort;
 pub use self::heap_sort::heap_sort;
 pub use self::insertion_sort::insertion_sort;