+1 vote
in Data Structures & Algorithms I by (110k points)
Suffix array can be created in O(nlogn) time.

(a) True

(b) False

The origin of the question is Arrays Types in section Arrays Types of Data Structures & Algorithms I

I had been asked this question in class test.

1 Answer

+1 vote
by (408k points)
selected by
Best answer
Right answer is (a) True

Easiest explanation - Suffix array can be constructed in O(n^2logn) time using sorting algorithms but it is possible to build the suffix array in O(nlogn) time using prefix doubling.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.