Skip to content

Commit 81534d5

Browse files
authored
Update README.markdown
1 parent eb95619 commit 81534d5

File tree

1 file changed

+1
-1
lines changed

1 file changed

+1
-1
lines changed

Diff for: Brute-Force String Search/README.markdown

+1-1
Original file line numberDiff line numberDiff line change
@@ -51,6 +51,6 @@ extension String {
5151

5252
This looks at each character in the source string in turn. If the character equals the first character of the search pattern, then the inner loop checks whether the rest of the pattern matches. If no match is found, the outer loop continues where it left off. This repeats until a complete match is found or the end of the source string is reached.
5353

54-
The brute-force approach works OK, but it's not very efficient (or pretty). It should work fine on small strings, though. For a smarter algorithm that works better with large chunks of text, check out [Boyer-Moore](../Boyer-Moore/) string search.
54+
The brute-force approach works OK, but it's not very efficient (or pretty). It should work fine on small strings, though. For a smarter algorithm that works better with large chunks of text, check out [Boyer-Moore](../Boyer-Moore-Horspool) string search.
5555

5656
*Written for Swift Algorithm Club by Matthijs Hollemans*

0 commit comments

Comments
 (0)