From bb3b75747277a70900a92e1d9971f9f8a3c1952f Mon Sep 17 00:00:00 2001 From: Tim Gates Date: Sat, 25 Dec 2021 07:55:03 +1100 Subject: [PATCH] docs: fix simple typo, contruction -> construction There is a small typo in README.md. Should read `construction` rather than `contruction`. --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index 63942ad..d3905d4 100644 --- a/README.md +++ b/README.md @@ -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.