MCQOPTIONS
Saved Bookmarks
| 1. |
What is the worst case running time of Rabin Karp Algorithm? |
| A. | Theta(n) |
| B. | Theta(n-m) |
| C. | Theta((n-m+1)m) |
| D. | Theta(nlogm) |
| Answer» D. Theta(nlogm) | |