Skip to content

Commit fef2b3a

Browse files
committed
add example animation to README
1 parent c185d99 commit fef2b3a

File tree

2 files changed

+3
-1
lines changed

2 files changed

+3
-1
lines changed

README.md

Lines changed: 3 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,8 +1,10 @@
11
# FJS string searching algorithm sample code
22

3+
![animation of the algorithm finding pattern "aabaa" in text "aabaabaaba bab aaabaa"](readme/images/fjs-animation.gif)
4+
35
String search algorithms find occurrences of a pattern string in a text, like the search feature of a text editor. The FJS (Franek-Jennings-Smyth) algorithm is the fastest known string search algorithm under a wide variety of conditions. It combines the linear-time worst case guarantee of the well-known KMP (Knuth-Morris-Pratt) algorithm with the fast average-case performance of the BMS (Boyer-Moore-Sunday) algorithm.
46

5-
[More information, including an interactive demo of the algorithm in action.](https://cgjennings.ca/articles/fjs.html)
7+
[More information, including an interactive visualization.](https://cgjennings.ca/articles/fjs.html)
68

79
## The sample code
810

readme/images/fjs-animation.gif

1.25 MB
Loading

0 commit comments

Comments
 (0)