Explanation: the auxiliary space complexity required by naive pattern searching algorithm is o(1). so it qualifies as an in place algorithm.
Q. The naive pattern searching algorithm is an in place algorithm.
β
Correct Answer: (A)
true
Explanation by: Mr. Dubey
the auxiliary space complexity required by naive pattern searching algorithm is o(1). so it qualifies as an in place algorithm.
Discussion
Question Analytics
377
Total Visits
2 y ago
Published
Mr. Dubey
Publisher
90%
Success Rate