Vidyalelo
Data Structure · Q83

Arrays in Data Structures

Programming · Data Structure · question 83

Q83

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

A.
O(nlogn)
B.
O(n2)
C.
O(n2logn)
Answer
D.
O(n2) + O(logn)

Answer: Option C

Solution

Answer: Option C
No explanation is given for this question Let's Discuss on Board