1. Computer Science Engineering (CSE)
  2. Design and Analysis of Algorithms
  3. What is the auxiliary space complexity o...
Q.

What is the auxiliary space 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» B. o(m)
Explanation: z algorithm is an efficient pattern searching algorithm as it searches the pattern in linear time. it an auxiliary space of o(m) for maintaining z array.

Discussion