β
Correct Answer: (A)
true
Explanation: the auxiliary space complexity required by naive pattern searching algorithm is o(1). so it qualifies as an in place algorithm.
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
441
Total Visits
3 y ago
Published
Mr. Dubey
Publisher
86%
Success Rate