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