Question

time complexity of naive pattern​

Answer 1

Explanation:

Naïve pattern searching is the simplest method among other pattern searching algorithms. It checks for all character of the main string to the pattern. ... The time complexity of Naïve Pattern Search method is O(m*n). The m is the size of pattern and n is the size of the main string.

Answer 2

Answer:

The time complexity of Naïve Pattern Search method is O(m*n). The m is the size of pattern and n is the size of the main string.