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

Warning: include(./views/auth.php): failed to open stream: Permission denied in /var/www/html/live/loginRightSlider.php on line 18

Warning: include(): Failed opening './views/auth.php' for inclusion (include_path='.:/usr/share/php') in /var/www/html/live/loginRightSlider.php on line 18
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