Solve
Guides
You visited us 0 times! Enjoying our articles? Unlock Full Access!
Question
Open in App
Solution
Verified by Toppr
It depends upon what type of search you are performing.in general case on a tree based searching methods Depth-First Search takes less memory since only the nodes on the current path are stored, but in Breadth First Search, all of the tree that has generated must be stored.
Was this answer helpful?
Similar Questions
Q
1
Which search algorithm takes less memory ?
View Solution
Q
2
Search engine software use algorithm.
View Solution
Q
3
If the binary search algorithm determines that the search arguments is in the upper half of the array, which of the following statements will set the appropriate variable to the appropriate value ?
View Solution
Q
4
Algorithm ′A′ for a problem ′P′ takes time of Which is true?
0.0001 n2, while algorithm ′B′ for the same problem takes 100 n log10 n
View Solution
Q
5
Algorithm 'A' for a problem 'P' takes time of 0.0001 n2, while algorithm 'B' for the same problem takes 100n log10n.
Which is true?
View Solution
