Talk:Suffix array

Suggestion: add articles for O(nlogn) and O(n) algorithms.
I searched for both Doubling Algorithm(which runs in O(nlogn) time) and Skew Algorithm(a.k.a. DC3, Difference Cover modulo 3), and there's no result. As an important data structure in string processing I think these two algorithms should be covered. I'm no expert so anyone willing to help? Actually I am named BNJ representing Benjamin Jones. But that name is occupied. (talk) 06:31, 24 January 2009 (UTC)

I've just added a light description of the underlying concepts of doubling and recursion. StephanErb (talk) 15:08, 4 September 2012 (UTC)

Lack of citations
We could use citations in a few places. We have references at the bottom, but no notes in the text. I'll fix when I have time. 70.68.169.53 (talk) 04:21, 20 October 2009 (UTC)
 * That was me. Blowfish (talk) 04:22, 20 October 2009 (UTC)

Consider it done. StephanErb (talk) 15:09, 4 September 2012 (UTC)

Algorithm
else if W > suffixAt(pos[m-1]) then ans = m seems to be wrong. it think it is else if W > suffixAt(pos[n-1]) then ans = n  —Preceding unsigned comment added by 92.230.235.192 (talk) 14:29, 22 October 2010 (UTC)

I second that. And fixed that and also R = m-1, which didn't match the description. Mjordan (talk) 06:19, 21 June 2011 (UTC)