Design and Analysis of Algorithms MCQ: What is the worst case time complexity of KMP algorithm for pattern searching (m = length of text, n = length of pattern)?

← All Design and Analysis of Algorithms questions

What is the worst case time complexity of KMP algorithm for pattern searching (m = length of text, n = length of pattern)?

Correct Answer: o(m)

Make the most of this question

This page focuses on one Design and Analysis of Algorithms question from Engineering. After checking the answer, return to the topic list to practice more or run a timed set.

← More Design and Analysis of Algorithms MCQs All Engineering topics Mock test hub