Iterative deepening depth-first search
Sorting algorithm
>
In computer science, iterative deepening search or more specifically iterative deepening depth-first search is a state space/graph search strategy in which a depth-limited version of depth-first search is run repeatedly with increasing depth... Wikipedia
Worst-case complexity: O(b^d)
Data structure: Tree, Graph
Optimal: yes (for unweighted graphs)
Worst-case space complexity: : 5