Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Algorithms Algorithm Design Techniques Greedy Algorithms
If b is the branching factor and m is the maximum depth of the search tree, what is the space complexity of greedy search ?
1
O (b + m)
2
O (bm)
3
O(bm)
4
O(mb)