+1 vote
in Data Structures & Algorithms I by (88.2k points)
What is the time complexity of Uttkonen’s algorithm?

(a) O (log n!)

(b) O (n!)

(c) O (n^2)

(d) O (n log n)

I need to ask this question from Suffix Tree in division Trie of Data Structures & Algorithms I

This question was posed to me in my homework.

1 Answer

+1 vote
by (672k points)
selected by
Best answer
Correct option is (d) O (n log n)

To explain: The concept of Suffix Tree was introduced by Weiner in 1973. Ukkonen provided the first online contribution of Suffix tree which had the time complexity of the fastest algorithm of that period. Ukkonen’s algorithm had a time complexity of n log n.

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.