I still don't understand. There's far quicker suffix array construction algorithms than O(n^2 log n)? There's O(n) algorithms
On 20 August 2012 23:27, pankajsingh <psingh...@gmail.com> wrote: > Thanks.carl and atul.!!.@carl-i got lgn due to string comparison sort > while making the suffix array..:) > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to algogeeks@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
