-
-
Notifications
You must be signed in to change notification settings - Fork 1.5k
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.
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
Information gap in suffix array article #1048
Comments
We look at the strings in a cyclic form. And the goal is, to sort all shifts, which is equivalent to sorting the cyclic substrings of length I hope that clears everything up. Tell us, if we should improve the article more. But I think it already tell all those ideas that I wrote. |
@jakobkogler That explains some of it. I assume we take I think a concrete example with comparisons of two strings (that includes sentinel '$')will definitely help here. |
After we use count sort. It's not clear as why are we comparing strings and what part of strings are we comparing with.
Moreover, how$2^k$ value came into the picture too is still a mystery. How are we making sure strings are of length $2^k$ ?
The text was updated successfully, but these errors were encountered: