Explanation: Each partially expanded node remembers which successor to generate next because of these condition, it uses less memory. 3. What is the space complexity of Greedy search?
A. O(b)
B. O(bl)
C. O(m)
D. O(bm)
Answer:A
Explanation: Each partially expanded node remembers which successor to generate next because of these condition, it uses less memory. 3. What is the space complexity of Greedy search?
A. O(b) B. O(bl) C. O(m) D. O(bm)