Arrays on Data Structure and Algorithms related Questions and Answers


Question :   What is the time required to locate the occurrences of a pattern P of length m in a string of length n using suffix array?
1. O(nm)
2. O(n2)
3. O(mnlogn)
4. O(mlogn)
Answer :   4 - O(mlogn)  

* Be the First to Post a Comment.

Submit comment :


Captcha Image
Reload

Ask Question

Captcha Image
Reload

Note : Name and Email never shown.





Subscribe


Become a part of EducationForever. Subscribe to our FREE Newsletter