More README formatting

Author: kanwei

README.markdown

@@ -1,14 +1,14 @@
-# algorithms
-
-[![Build Status](https://travis-ci.org/kanwei/algorithms.png)](https://travis-ci.org/kanwei/algorithms)
+# algorithms [![Build Status](https://travis-ci.org/kanwei/algorithms.png)](https://travis-ci.org/kanwei/algorithms)
 
 ## DESCRIPTION:
 
 Started as a [Google Summer of Code 2008](http://code.google.com/soc/2008/ruby/about.html) project
 
 Written by [Kanwei Li](http://kanwei.com/), mentored by Austin Ziegler
 
-Original Proposal: Using the right data structure or algorithm for the situation is an important
+### Original Proposal: ###
+
+Using the right data structure or algorithm for the situation is an important
 aspect of programming. In computer science literature, many data structures
 and algorithms have been researched and extensively documented. However, there
 is still no standard library in Ruby implementing useful structures and
@@ -19,28 +19,28 @@ compare performance in different situations.
 
 ## COMPLETED:
 
-* Heaps              Containers::Heap, Containers::MaxHeap, Containers::MinHeap
-* Priority Queue     Containers::PriorityQueue
-* Deque              Containers::Deque, Containers::CDeque (C extension), Containers::RubyDeque
-* Stack              Containers::Stack (uses Deque)
-* Queue              Containers::Queue (uses Deque)
-* Red-Black Trees    Containers::RBTreeMap, Containers::CRBTreeMap (C extension), Containers::RubyRBTreeMap
-* Splay Trees        Containers::SplayTreeMap, Containers::CSplayTreeMap (C extension), Containers::RubySplayTreeMap
-* Tries              Containers::Trie
-* Suffix Array       Containers::SuffixArray
-
-* Search algorithms
-  - Binary Search            Algorithms::Search.binary_search
-  - Knuth-Morris-Pratt       Algorithms::Search.kmp_search
-* Sort algorithms           
-  - Bubble sort              Algorithms::Sort.bubble_sort
-  - Comb sort                Algorithms::Sort.comb_sort
-  - Selection sort           Algorithms::Sort.selection_sort
-  - Heapsort                 Algorithms::Sort.heapsort
-  - Insertion sort           Algorithms::Sort.insertion_sort
-  - Shell sort               Algorithms::Sort.shell_sort
-  - Quicksort                Algorithms::Sort.quicksort
-  - Mergesort                Algorithms::Sort.mergesort
+    * Heaps              Containers::Heap, Containers::MaxHeap, Containers::MinHeap
+    * Priority Queue     Containers::PriorityQueue
+    * Deque              Containers::Deque, Containers::CDeque (C ext)
+    * Stack              Containers::Stack
+    * Queue              Containers::Queue
+    * Red-Black Trees    Containers::RBTreeMap, Containers::CRBTreeMap (C ext)
+    * Splay Trees        Containers::SplayTreeMap, Containers::CSplayTreeMap (C ext)
+    * Tries              Containers::Trie
+    * Suffix Array       Containers::SuffixArray
+
+    * Search algorithms
+      - Binary Search            Algorithms::Search.binary_search
+      - Knuth-Morris-Pratt       Algorithms::Search.kmp_search
+    * Sorting algorithms           
+      - Bubble sort              Algorithms::Sort.bubble_sort
+      - Comb sort                Algorithms::Sort.comb_sort
+      - Selection sort           Algorithms::Sort.selection_sort
+      - Heapsort                 Algorithms::Sort.heapsort
+      - Insertion sort           Algorithms::Sort.insertion_sort
+      - Shell sort               Algorithms::Sort.shell_sort
+      - Quicksort                Algorithms::Sort.quicksort
+      - Mergesort                Algorithms::Sort.mergesort
 
 ## SYNOPSIS:
 
@@ -62,7 +62,7 @@ compare performance in different situations.
 
 (The MIT License)
 
-Algorithms and Containers project is Copyright (c) 2009 Kanwei Li
+Ruby Algorithms and Containers project is Copyright (c) 2009 Kanwei Li
 
 Permission is hereby granted, free of charge, to any person obtaining
 a copy of this software and associated documentation files (the