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)

Sponsored

hivanix.in

Visit

This quiz is brought to you by hivanix.in

🌐 Web App Development

Other Tools: chatwiz.hivanix.in mmspace.hivanix.in unogame.hivanix.in

Quick Navigation

Home

Subjects

Chapters