How to construct a suffix array in O(n*logn) TC

Правка en1, от v-O_O-v, 2019-08-10 08:26:10

Hi, I started studying string alg's and I did not really understand how do we construct a suffix array in O(n*log n). I can implement an O(n^2 log n) alg. But it can fail for reasonably long strings. Can someone please provide a detailed implementation (if possible with comments) of the suffix array. I saw the codes of some users but I am not able to understand anything from it. Please help me. Thanks.

Теги #strings

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский v-O_O-v 2019-08-10 08:26:10 453 Initial revision (published)