Q. What is the time complexity of Z algorithm for pattern searching (m = length of text, n = length of pattern)?
✅ Correct 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.