There exist algorithms that construct the suffix array in linear time (given that the number of alphabets is constant). An example algorithm that's known is small/large suffixes. It would be nice for the article to go over such algorithms.