Update README.md

Mooophy · Mooophy · commit f277a6653831 · 2015-04-05T12:41:31.000+12:00
diff --git a/ch02/README.md b/ch02/README.md
@@ -220,9 +220,9 @@ Are-There-Two-Elements-That-Have-Sum-As-Specified(set, sum)
  
 ```cpp
 As shown in Figure 2.5:
-    it takes theta(n) to merge each level in recursion tree. "
+    it takes theta(n) to merge each level in recursion tree. 
     total height of the recursion is theta(lg(n))
-    merging start from the first level to lg(k)
+    merging start from the first level to lg(k):
         theta(n(lg(n) - lg(k))) = theta(n(lg(n/k)))
 Hence, it takes T(n) = theta(n(lg(n/k))) to merge the sublists.
 ```
