| Q. |
What is the time complexity of Z algorithm for pattern searching (m = length of text, n = length of pattern)? |
| A. | o(n + m) |
| B. | o(m) |
| C. | o(n) |
| D. | o(m * n) |
| Answer» A. o(n + m) | |
| Explanation: z algorithm is an efficient pattern searching algorithm as it searches the pattern in linear time. it has a time complexity of o(m + n) where m is the length of text and n is the length of the pattern. | |
Login to Continue
It will take less than 2 minutes