Tobby_And_Friends's blog

Blog/Tutorial on suffix array implementation in O(n log n)
By Tobby_And_Friends, history, 9 years ago, In English

I understand the O(nlog^2n) implementation but I want to learn the nlogn implementation. So, if anyone can suggest me any blog or tutorial related to this it would be very helpful.

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

»
9 years ago, hide # |
← Rev. 2  
Vote: I like it +3 Vote: I do not like it

The implementation for O(n log n) is same as O(nlog^2n) but with O(n) sorting at each step (Radix sort) instead of O(n log n) sorting

→ Reply