What is the worst case time complexity of KMP algorithm for pattern searching (m = length of text, n = length of pattern)?
(a) O(n)
(b) O(n*m)
(c) O(m)
(d) O(log n)
I had been asked this question during an online exam.
This interesting question is from Searching topic in section Searching of Data Structures & Algorithms II