Added first effort in Rust

sorting_algorithms/merge_sort/rust/Cargo.toml

@@ -0,0 +1,10 @@
+[package]
+name = "rust"
+version = "0.1.0"
+authors = ["Christian Chavez <[email protected]>"]
+
+[dependencies]
+num-integer = "0.1.35"
+
+[dev-dependencies]
+proptest = "0.3.1"

sorting_algorithms/merge_sort/rust/src/main.rs

@@ -0,0 +1,23 @@
+
+fn merge_sort<T:Clone + Ord>(arg: &[T]) -> ~[T] {
+    unimplemented!();
+}
+
+// TODO: Figure out proptest crate...
+// proptest! {
+    // #[test]
+    // fn bleh(){
+    //     assert!(true == true);;
+    // }
+// }
+
+fn main() {
+    println!("Hello, world!");
+    let mut list = vec![
+        4,
+        1,
+        3,
+        2,
+    ] as Vec<i32>;
+    merge_sort(&mut list);
+}

sorting_algorithms/merge_sort/rust/test/quickcheck.rs

@@ -0,0 +1,22 @@
+#![feature(plugin)]
+#![plugin(quickcheck_macros)]
+
+#[cfg(test)]
+extern crate quickcheck;
+
+// #[cfg(test)]
+// mod tests {
+//     fn reverse<T: Clone>(xs: &[T]) -> Vec<T> {
+//         let mut rev = vec!();
+//         for x in xs {
+//             rev.insert(0, x.clone())
+//         }
+//         rev
+//     }
+
+//     #[quickcheck]
+//     fn double_reversal_is_identity(xs: Vec<isize>) -> bool {
+//         xs == reverse(&reverse(&xs))
+//     }
+// }
+