Substring in Data Structure And Algorithm : Practice MCQ Questions & Answers with Explanations

The worst case time complexity of Rabin Karp algorithm is O(m*n) but it has a linear average case time complexity. So Rabin Karp and naive pattern searching algorithm have the same worst case time complexity.

The auxiliary space complexity required by naive pattern searching algorithm is O(1). So it qualifies as an in place algorithm.

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.

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.

KMP algorithm is an efficient pattern searching algorithm. It has a time complexity of O(m) where m is the length of text.