Skip to content

docs: fix simple typo, contruction -> construction #9

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open

docs: fix simple typo, contruction -> construction #9

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,7 +2,7 @@ Suffix Trees in Python
================================

Based off of Mark Nelson's C++ implementation of Ukkonen's algorithm. Ukkonen's
algorithm gives a O(n) + O(k) contruction time for a suffix tree, where n is
algorithm gives a O(n) + O(k) construction time for a suffix tree, where n is
the length of the string and k is the size of the alphabet of that string.
Ukkonen's is an online algorithm, processing the input sequentially and producing
a valid suffix tree at each character.
Expand Down