Can Somebody explain me the working of Suffix Array Construction Algorithm given in e-maxx.ru page
I am unable to understand its code
A explanation with a small example can be quite effective
Asked
Active
Viewed 147 times
0
-
It is not possible to describe this algorithm concisely. I would recommend you reading about it somewhere else. – kraskevich Oct 16 '14 at 14:20
-
I am able to understand the first part of the code the problem occurs only in a single line where i am unable to understand that is **p[--cnt[c[pn[i]]]] = pn[i];** Also why in this looping starts from n-1 to 0 instead of 0 to n-1 – pulkit-singhal Oct 16 '14 at 14:45
-
I wouldn't use this implementation at all if I were you. The code is where unclear there. This line actually is an implementation of radix sort. – kraskevich Oct 16 '14 at 14:58
-
Can you suggest me some better source for reading about this – pulkit-singhal Oct 16 '14 at 15:03
-
You can ask the algorithm author - there is a discussion thread at the end of the page you've mentioned. – HEKTO Oct 16 '14 at 18:04