Finished Chapter 7

Author: senrust

chapter_7/counting_sort/Cargo.lock

@@ -0,0 +1,10 @@
+[package]
+name = "counting_sort"
+version = "0.1.0"
+authors = ["Yohei Osawa <[email protected]>"]
+edition = "2018"
+
+# See more keys and their definitions at https://doc.rust-lang.org/cargo/reference/manifest.html
+
+[dependencies]
+input = {path = "../../library/input"}

chapter_7/counting_sort/Cargo.toml

@@ -0,0 +1,17 @@
+fn main() {
+    let vec: Vec<i32> = input::read_numline();
+    let max_value = vec.iter().max().unwrap();
+    let mut count_vec = vec![0; *max_value as usize + 1];
+    for i in vec {
+        count_vec[i as usize] += 1;
+    }
+    let mut sorted_vec = Vec::<i32>::new();
+    for i in 0..count_vec.len() {
+        if count_vec[i] != 0 {
+            for _ in 0..count_vec[i]{
+                sorted_vec.push(i as i32);
+            }
+        }
+    }
+    println!("sorted vec is {:?}", sorted_vec);
+}

chapter_7/counting_sort/src/main.rs

@@ -0,0 +1,11 @@
+[package]
+name = "merge_sort"
+version = "0.1.0"
+authors = ["Yohei Osawa <[email protected]>"]
+edition = "2018"
+
+# See more keys and their definitions at https://doc.rust-lang.org/cargo/reference/manifest.html
+
+[dependencies]
+input = {path = "../../library/input"}
+num = "0.3.1"

chapter_7/merge_sort/Cargo.lock

@@ -0,0 +1,38 @@
+use num::Bounded;
+
+fn merge<T: Copy + Bounded + Ord>(vec: &mut Vec<T>, left: usize, right: usize, mid: usize) {
+    let max_value:T  = Bounded::max_value();
+    let mut vec_left = vec[left..mid].to_vec();
+    let mut vec_right = vec[mid..right].to_vec();
+    vec_left.push(max_value);
+    vec_right.push(max_value);
+
+    let mut left_index = 0;
+    let mut right_index = 0;
+    for i in left..right{
+        if vec_left[left_index] > vec_right[right_index] {
+            vec[i] = vec_right[right_index];
+            right_index += 1;
+        } else {
+            vec[i] = vec_left[left_index];
+            left_index += 1;
+        }
+    }
+}
+
+fn merge_sort<T: Copy + Bounded + Ord>(vec: &mut Vec<T>, left: usize, right: usize) {
+    if left + 1 == right {
+        return;
+    }
+    let mid = (left + right) / 2;
+    merge_sort(vec, left, mid);
+    merge_sort(vec, mid, right);
+    merge(vec, left, right, mid);
+}
+
+fn main() {
+    let mut input_vec: Vec<i32> = input::read_numline::<i32>();
+    let len =  input_vec.len();
+    merge_sort(& mut input_vec, 0, len);
+    println!("sorted input is {:?}", input_vec);
+}

chapter_7/merge_sort/Cargo.toml

@@ -0,0 +1,10 @@
+[package]
+name = "partition"
+version = "0.1.0"
+authors = ["Yohei Osawa <[email protected]>"]
+edition = "2018"
+
+# See more keys and their definitions at https://doc.rust-lang.org/cargo/reference/manifest.html
+
+[dependencies]
+input = {path = "../../library/input"}

chapter_7/merge_sort/src/main.rs

@@ -0,0 +1,18 @@
+fn main() {
+    let patition_num: i32 = input::read_number();
+    let mut vec: Vec<i32> = input::read_numline();
+    vec.push(patition_num);
+    let mut border = 0;
+    for j in 0..vec.len() {
+        if patition_num > vec[j] {
+            vec.swap(border, j);
+            border += 1;
+        } else{
+            // nothing
+        }
+    }
+    let last_index = vec.len() -1;
+    vec.swap(border, last_index);
+
+    println!("patitioned vec is {:?}", vec);
+}

chapter_7/partition/Cargo.lock

@@ -0,0 +1,10 @@
+[package]
+name = "quick_sort"
+version = "0.1.0"
+authors = ["Yohei Osawa <[email protected]>"]
+edition = "2018"
+
+# See more keys and their definitions at https://doc.rust-lang.org/cargo/reference/manifest.html
+
+[dependencies]
+input = {path = "../../library/input"}

chapter_7/partition/Cargo.toml

@@ -0,0 +1,30 @@
+fn make_partition(vec: &mut Vec<i32>, left: usize, right: usize) -> usize {
+    let patition_num = vec[right -1];
+    let mut border = left;
+    for j in left..right {
+        if patition_num > vec[j] {
+            vec.swap(border, j);
+            border += 1;
+        } else{
+            // do nothing
+        }
+    }
+    vec.swap(border, right -1);
+    border
+}
+
+fn quick_sort(vec: &mut Vec<i32>, left: usize, right: usize) {
+    if left + 1 >= right {
+        return;
+    }
+    let border = make_partition(vec, left, right);
+    quick_sort(vec, left, border);
+    quick_sort(vec, border + 1, right);
+}
+
+fn main() {
+    let mut vec: Vec<i32> = input::read_numline();
+    let vec_len = vec.len();
+    quick_sort(&mut vec, 0, vec_len);
+    println!("sort result is {:?}", vec);
+}