Implementation of O(n) time suffix array construction algorithm for constant alphabets with O(1) additional memory, described by Ge Nong[1]
[1] Nong, G. 2013. Practical linear-time O(1)-workspace suffix sorting for constant alphabets
[2] Nong, G., Zhang, S., and Chan, W. H. 2011. Two efficient algorithms for linear time suffix array construction.