Update README.md

ch02/README.md

@@ -304,7 +304,7 @@ I.M.T -> LI holds.
 
  * d. time complexity = theta(n^2). Insertion-Sort is better. Because for average case and best case Insertion-Sort doesn't have to carry out theta(n) for its nested loop. whereas Bubble-Sort has to do so for any case.
 
-##Problem 2-3 Horner’s rule [Implementation](src/polynomial.hpp)|[Test])(test/test_polynomial.hpp)
+##Problem 2-3 Horner’s rule [Implementation](src/polynomial.hpp) | |[Test](test/test_polynomial.hpp)
  * Time complexity : theta(n)
  * pseudocode
 ```python
@@ -357,7 +357,7 @@ L.I. holds.
 
  * As shown above, this code fragment correctly evaluates a polynomial.
 
-##Problem 2-4 Inversions [Implementation](find_inversions.hpp)|[Test](test_find_inversions.cpp)
+##Problem 2-4 Inversions [Implementation](src/find_inversions.hpp) | [Test](src/test_find_inversions.cpp)
  *  Five inversions:
 ```cpp
 {2,1}, {3,1}, {8,1}, {6,1}, {8,6}