v-O_O-v's blog

How to construct a suffix array in O(n*logn) TC
By v-O_O-v, history, 5 years ago, In English

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.

  • Vote: I like it
  • -10
  • Vote: I do not like it

Comments Comments (3)
| Write comment?
»
5 years ago, # |
  Vote: I like it 0 Vote: I do not like it

You can take help from here

→ Reply
»
5 years ago, # |
  Vote: I like it 0 Vote: I do not like it

You can follow this

→ Reply
»
5 years ago, # |
  Vote: I like it 0 Vote: I do not like it

https://stackoverflow.com/questions/34402080/suffix-array-construction-on-logn-competitive-programming-3-steven-halim

here is a code from a competitve programming book

→ Reply