If comparison based sorting algorithm is used construct the suffix array...

Home / Data Structure / Arrays In Data Structures / Question

Examveda

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(n²)

C. O(n²logn)

D. O(n²) + O(logn)

Answer: Option C

Related Questions on Arrays in Data Structures

A. O(n)

B. O(1)

C. O(log n)

D. O(n log n)

View Answer

A. int array[];

B. array{int};

C. int array[10];

D. int array();

View Answer

B. null

C. -1

D. undefined

View Answer

A. array.size();

B. array.length;

C. array.length();

D. array.size;

View Answer