MCQOPTIONS
Saved Bookmarks
| 1. |
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? |
| A. | O(nm) |
| B. | O(n2) |
| C. | O(mnlogn) |
| D. | O(mlogn) |
| Answer» E. | |