What is the worst case time complexity of KMP algorithm for pattern searching (m = length of text, n = length of pattern)?
|Answer» C. o(m)|
|Explanation: kmp algorithm is an efficient pattern searching algorithm. it has a time complexity of o(m) where m is the length of text.|
Login to Continue
It will take less than 2 minutes