If comparison based sorting algorithm is used construct the suffix array, then what will be time required to construct the suffix array? - Study24x7
Social learning Network
25 Mar 2019 10:14 AM study24x7 study24x7

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)

D

O(n2) + O(logn)

study24x7
Write a comment
Related Questions
500+   more Questions to answer
Most Related Articles