Computer Science · Algorithms

Given a string S of length n, what is the worst-case time complexity of the naive string matching algorithm to find a pattern P of length m?

Verified Solution4 OptionsUpdated: October 2026👁️1 View

1O(m log n)
2O(n log m)
3O(n × m)✓
4O(n + m)

Correct answer

O(n × m)

Download Single Question PDF

Save this question and verified answer as a clean study sheet with live clickable link.

👥

Share with Friends & Study Groups

Challenge your peer aspirants on WhatsApp or Telegram to solve this question!

Online Test Series

Preparing for Computer Science?

Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.

Start Free Mock Test →

Chapter Practice

Want more practice questions on Algorithms?

Solve complete topic-wise tests with detailed solutions on GkGet.

Practice Algorithms MCQs →

Recommended practice questions in Computer Science · Algorithms

Browse More Computer Science →

Which Indian independence movement leader was primarily known for his philosophy and practice of non-violent civil disobedience?

Solve Question→

Who gave the call for 'Do or Die' during the Quit India Movement in 1942?

Solve Question→

Which of the following revolutionary pairs were imprisoned together in Cellular Jail and faced harsh conditions, contributing significantly to the Indian independence movement?

Given a string S of length n, what is the worst-case time complexity of the naive string matching algorithm to find a pattern P of length m?

Download Single Question PDF

Share with Friends & Study Groups

Preparing for Computer Science?

Practice by Subject

Practice by Exam

Topic-Wise Solved Questions

Given a string S of length n, what is the worst-case time complexity of the naive string matching algorithm to find a pattern P of length m?

Download Single Question PDF

Share with Friends & Study Groups

Preparing for Computer Science?

Related Practice Questions

Practice by Subject

Practice by Exam

Topic-Wise Solved Questions