> For the complete documentation index, see [llms.txt](https://cs61b.bencuan.me/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://cs61b.bencuan.me/algorithms.md).

# Algorithms

- [Minimax Algorithm](https://cs61b.bencuan.me/algorithms/minimax.md)
- [Searching](https://cs61b.bencuan.me/algorithms/searching.md)
- [Binary Search](https://cs61b.bencuan.me/algorithms/searching/binary-search.md)
- [Depth First Search (DFS)](https://cs61b.bencuan.me/algorithms/searching/depth-first-search-dfs.md)
- [Breadth First Search (BFS)](https://cs61b.bencuan.me/algorithms/searching/breadth-first-search-bfs.md)
- [Shortest Paths](https://cs61b.bencuan.me/algorithms/shortest-paths.md)
- [Dijkstra's Algorithm](https://cs61b.bencuan.me/algorithms/shortest-paths/dijkstras-algorithm.md): Special thanks to Arin for writing this page!
- [A\* Search](https://cs61b.bencuan.me/algorithms/shortest-paths/a-search.md): Special thanks to Arin for writing this page!
- [Minimum Spanning Trees](https://cs61b.bencuan.me/algorithms/minimum-spanning-trees.md): Special thanks to Arin for writing this page!
- [Prim's Algorithm](https://cs61b.bencuan.me/algorithms/minimum-spanning-trees/prims-algorithm.md): Special thanks to Arin for writing this page!
- [Kruskal's Algorithm](https://cs61b.bencuan.me/algorithms/minimum-spanning-trees/kruskals-algorithm.md): Special thanks to Arin for writing this page!