Solving Problems by Search

There are a couple ways to solve problems with search.

I will be talking about

$Algorithm$	Action Costs	Space Complexity	Time Complexity
Backtracking Search	any	$O(D)$	$O(b^D)$
Depth First Search (DFS)	-	$O(D)$	$O(b^D)$
Breadth First Search (BFS)	$c \ge 0$	$O(b^d)$	$O(b^d)$
Iterative Deepening Search	$c \ge 0$	$O(d)$	$O(b^d)$