It combines the benefits of BFS and DFS search algorithm in terms of fast search and memory efficiency.
main drawback of Iterative Depending Depth First Search (IDDFS) is that it repeats all the work of previous phase.
Let's suppose b is the branching factor and depth is d when the worst case of time complexity is O(bd)..
The space complexity of IDDFS will be O(bd).
IDDFS algorithm is optimal if the path cost is a non-decreasing function of the node.
Silan Software is one of the India's leading provider of offline & online training for Java, Python, AI (Machine Learning, Deep Learning), Data Science, Software Development & many more emerging Technologies.
We provide Academic Training || Industrial Training || Corporate Training || Internship || Java || Python || AI using Python || Data Science etc