Add to Chrome
✅ The verified answer to this question is available below. Our community-reviewed solutions help you understand the material better.
Пусть
n - длина слова,
m - длина образа.
Какова наихудшая трудоемкость простого поиска образа в строке?
O(nm)
O(n)
O(n+m)
O(n*m)
Get Unlimited Answers To Exam Questions - Install Crowdly Extension Now!