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).

Related Questions

A teacher asked the class to subtract 5 from 75.70% of the class said: 25. Their work was shown as: \(\begin{array}{*{20}{c}} {\begin{array}{*{20}{c}} 7&5 \end{array}}\\ {\underline {\begin{array}{*{20}{c}}\ { - 5} \ \ \ &{} \end{array}} }\\ {\underline {\begin{array}{*{20}{c}} 2&5 \end{array}} } \end{array}\) Which of the following describes the most appropriate remedial action that the teacher should take to clarify this misconception?
Statement 1: Shell sort is a stable sorting algorithm. Statement 2: Shell sort is an in-place sorting algorithm.
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?