AI MCQ #240: What is the space complexity of Greedy search?

by

Q240. What is the space complexity of Greedy search?

  • a) O(b)
  • b) O(bl)
  • c) O(m)
  • d) O(bm)

✅ Correct Answer: D) O(bm)

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.