If comparison based sorting algorithm is used construct the suffix array, then what will be time required to construct the suffix array?

If comparison based sorting algorithm is used construct the suffix array, then what will be time required to construct the suffix array? Correct Answer O(n2logn)

On average comparison based sorting algorithms require O(nlogn) comparisons. But comparing a suffix takes O(n). So, overall time to construct the suffix array will be O(nlogn) * O(n) = O(n2logn).
Bissoy MCQ

Related Questions

Statement 1: Shell sort is a stable sorting algorithm. Statement 2: Shell sort is an in-place sorting algorithm.
A material is loaded elastically under plane stress condition given by the following tensor:
\[\left[ {\begin{array}{*{20}{c}} 1 \\ 0 \end{array}\begin{array}{*{20}{c}} 2 \\ 1 \end{array}\begin{array}{*{20}{c}} 0 \\ 0 \end{array}} \right
Introsort begins sorting the given array by using which of the following sorting algorithm?
Tim sort begins sorting the given array by using which of the following sorting algorithm?
Strand sort is a comparison based sorting algorithm.
Bead sort is a comparison based sorting algorithm.
Stooge sort is a comparison based sorting algorithm.
Which of the following is/are advantages suffix array one suffix tree? I. Lesser space requirement II. Improved cache locality III. Easy construction in linear time
Suffix array can be created by performing __________ traversal of a suffix tree.
Suffix array is space efficient than the suffix tree.