Use app×
Join Bloom Tuition
One on One Online Tuition
JEE MAIN 2025 Foundation Course
NEET 2025 Foundation Course
CLASS 12 FOUNDATION COURSE
CLASS 10 FOUNDATION COURSE
CLASS 9 FOUNDATION COURSE
CLASS 8 FOUNDATION COURSE
0 votes
331 views
in Information Technology by (120k points)
closed by
The naive pattern searching algorithm is an in place algorithm.

(a) true

(b) false

The question was posed to me in examination.

My question is based upon Searching in section Searching of Data Structures & Algorithms II

1 Answer

0 votes
by (121k points)
selected by
 
Best answer
The correct answer is (a) true

Easiest explanation - The auxiliary space complexity required by naive pattern searching algorithm is O(1). So it qualifies as an in place algorithm.

Welcome to Sarthaks eConnect: A unique platform where students can interact with teachers/experts/students to get solutions to their queries. Students (upto class 10+2) preparing for All Government Exams, CBSE Board Exam, ICSE Board Exam, State Board Exam, JEE (Mains+Advance) and NEET can ask questions from any subject and get quick answers by subject teachers/ experts/mentors/students.

Categories

...