Question

What is the space complexity of Greedy search?

(a) O(b)

(b) O(bl)

(c) O(m)

(d) O(bm)

I got this question during an online interview.

I'm obligated to ask this question of Informed Search and Exploration topic in chapter Problem Solving of Artificial Intelligence

Select the correct answer from above options

Interview Questions and Answers, Database Interview Questions and Answers for Freshers and Experience

Answer 1

Correct answer is (d) O(bm)

Best explanation: O(bm) is the space complexity where b is the branching factor and m is the maximum depth of the search tree. Since this algorithm resembles the DFS.