Review of Searching Algorithms
| Type | Ordering | Optimal? | Complete? | Efficient? | |
| Depth First | Uninformed | LIFO | No | No | If lucky |
| Breadth First | Uninformed | FIFO | If step costs are identical |
Yes | No |
| Uniform Cost | Uninformed | g(n) | If step cost>0 | If step cost>0 | No |
| Greedy | Informed | h(n) | No | No | Usually |
| A* | Informed | g(n)+h(n) | If heuristic is admissle |