1. Computer Science Engineering (CSE)
  2. Design and Analysis of Algorithms
  3. What is the time complexity of Z algorit...

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.