Update README.md

Mooophy · Apr 5, 2015 · 5ae9812 · 5ae9812
1 parent 88cfcaa
commit 5ae9812
Showing 1 changed file with 2 additions and 2 deletions.
diff --git a/ch02/README.md b/ch02/README.md
@@ -218,11 +218,11 @@ Are-There-Two-Elements-That-Have-Sum-As-Specified(set, sum)
 ```
  *  Time complexity for merging all sublists
  
- ```cpp
+```cpp
  From Figure 2.5:
   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)
     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.
- ```
+```