Added Rust implementation of bubble sort. (algorithm-archivists#136)

* Added Rust implementation of bubble sort.

* Fixed tiny spelling mistake.

* Changed sort parameter.

* Changed a comment.

* Removed comment.

Author: Pen

CONTRIBUTORS.md

@@ -5,4 +5,5 @@ Gathros
 Jeremie Gillet (- Jie -)
 Salim Khatib
 Hitesh C
-Jess 3Jane
+Pen Pal
+Jess 3Jane

chapters/sorting_searching/bubble/bubble_sort.md

@@ -20,6 +20,8 @@ This means that we need to go through the vector $$\mathcal{O}(n^2)$$ times with
 [import, lang:"haskell"](code/haskell/bubbleSort.hs)
 {% sample lang="cpp" %}
 [import, lang:"c_cpp"](code/c++/bubblesort.cpp)
+{% sample lang="rs" %}
+[import:6-19, lang:"rust"](code/rust/bubble_sort.rs)
 {% sample lang="d" %}
 [import:3-18, lang:"d"](code/d/bubble_sort.d)
 {% endmethod %}

chapters/sorting_searching/bubble/code/rust/bubble_sort.rs

@@ -0,0 +1,27 @@
+extern crate rand; // External crate that provides random number generation tools
+
+use rand::{thread_rng, Rng}; // Used for random number generation
+use rand::distributions::Uniform; // Used for a uniform distribution
+
+fn bubble_sort(a: &mut [u32]) {
+    let n = a.len();
+
+    for _ in 0..n {
+        for j in 1..n {
+            if a[j - 1] > a[j] {
+                a.swap(j, j - 1);
+            }
+        }
+    }
+}
+
+fn main() {
+    let mut rng = thread_rng(); // Create random number generator
+    let num_range = Uniform::new_inclusive(0, 10000); // Obtain uniform distribution of range [0, 10000]
+    let mut rand_vec: Vec<u32> = rng.sample_iter(&num_range).take(10).collect();
+    // Generates random values over that range, take 10 values from it and collect in vector
+
+    println!("Before sorting: {:?}", rand_vec);
+    bubble_sort(&mut rand_vec);
+    println!("After sorting: {:?}", rand_vec);
+}