robert: Enable insertion sort

robert/src/bin/insertion_sort.rs.old → robert/src/bin/insertion_sort.rs

@@ -2,13 +2,15 @@
 // Use of this source is governed by General Public License that can be found
 // in the LICENSE file.
 
-use base::ints;
+use robert::util::{is_sorted, read_ints, show_brief};
+use sorts::insertion_sort;
 
 fn main() {
-    let mut list = ints::read_ints();
+    let mut list = read_ints();
     println!("[InsertionSort] LIST:");
-    sort::generics::show(&list);
-    sort::insertion_sort(&mut list);
+    show_brief(&list);
+    insertion_sort(&mut list);
     println!("RESULT:");
-    sort::generics::show(&list);
+    assert!(is_sorted(&list));
+    show_brief(&list);
 }

robert/src/bin/selection_sort.rs

@@ -2,18 +2,13 @@
 // Use of this source is governed by General Public License that can be found
 // in the LICENSE file.
 
-use robert::util::{is_sorted, read_ints, show};
+use robert::util::{is_sorted, read_ints, show_brief};
 use sorts::selection_sort;
 
 fn main() {
     let mut list = read_ints();
     selection_sort(&mut list);
     assert!(is_sorted(&list));
     println!("RESULT:");
-    if list.len() < 128 {
-        show(&list);
-    } else {
-        show(&list[..128]);
-        println!("...\n...");
-    }
+    show_brief(&list);
 }

robert/src/util.rs

@@ -32,6 +32,18 @@ where
     println!();
 }
 
+pub fn show_brief<T>(slice: &[T])
+where
+    T: fmt::Display,
+{
+    if slice.len() < 128 {
+        show(slice);
+    } else {
+        show(&slice[..128]);
+        println!("...\n...");
+    }
+}
+
 /// Read integers from stdin.
 ///
 /// # Panics