Comparison of preceding algorithms complexities

Let's take a look at some of the interesting results by comparing our first five algorithms. Here's the performance of the algorithms based on various criteria:

Criteria

Breadth First

Depth First

Bidirectional

Uniform Cost

Deepening

Time

bd

bm

bd/2

bd

bd

Space

bd

bm

bd/2

bd

bd

Optimality

Yes

No

Yes

Yes

Yes

Completeness

Yes

No

Yes

Yes

Yes

Get Learning Android Game Development now with the O’Reilly learning platform.

O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.