Fixed broken link

Author: Potecaru Tudor

readme.md

@@ -51,7 +51,7 @@ Classic Algorithms
 
 **Closest pair problem** - The closest pair of points problem or closest pair problem is a problem of computational geometry: given *n* points in metric space, find a pair of points with the smallest distance between them.
 
-[**Sieve of Eratosthenes**](https://github.com/quitrk/LearningJS/blob/master/Classic%20Algorithms/03.%Sieve%20of%20Eratosthenes.js) - The sieve of Eratosthenes is one of the most efficient ways to find all of the smaller primes (below 10 million or so).
+[**Sieve of Eratosthenes**](https://github.com/quitrk/LearningJS/blob/master/Classic%20Algorithms/03.%20Sieve%20of%20Eratosthenes.js) - The sieve of Eratosthenes is one of the most efficient ways to find all of the smaller primes (below 10 million or so).
 
 
 Graph