Update README.markdown

Boyer-Moore path is wrong.

Author: volkanbicer

README.markdown

@@ -33,7 +33,7 @@ If you're new to algorithms and data structures, here are a few good ones to sta
 - [Insertion Sort](Insertion%20Sort/)
 - [Binary Search](Binary%20Search/) and [Binary Search Tree](Binary%20Search%20Tree/)
 - [Merge Sort](Merge%20Sort/)
-- [Boyer-Moore string search](Boyer-Moore/)
+- [Boyer-Moore string search](Boyer-Moore-Horspool/)
 
 ## The algorithms
 
@@ -51,7 +51,7 @@ If you're new to algorithms and data structures, here are a few good ones to sta
 ### String Search
 
 - [Brute-Force String Search](Brute-Force%20String%20Search/). A naive method.
-- [Boyer-Moore](Boyer-Moore/). A fast method to search for substrings. It skips ahead based on a look-up table, to avoid looking at every character in the text.
+- [Boyer-Moore](Boyer-Moore-Horspool/). A fast method to search for substrings. It skips ahead based on a look-up table, to avoid looking at every character in the text.
 - [Knuth-Morris-Pratt](Knuth-Morris-Pratt/). A linear-time string algorithm that returns indexes of all occurrencies of a given pattern.
 - [Rabin-Karp](Rabin-Karp/)  Faster search by using hashing.
 - [Longest Common Subsequence](Longest%20Common%20Subsequence/). Find the longest sequence of characters that appear in the same order in both strings.