# List of algorithms to memorise for DAA

> Source: https://ollybritton.com/notes/uni/prelims/ht23/daa/notes/list-of-algorithms-to-memorise-for-daa/ · Updated: 2025-09-30 · Tags: uni, notes

- [Course - Design and Analysis of Algorithms HT23](https://ollybritton.com/notes/uni/prelims/ht23/daa/)

### Elementary graph algorithms
#### Breadth-first search
- [Notes - DAA HT23, Breadth-first search](https://ollybritton.com/notes/uni/prelims/ht23/daa/notes/breadth-first-search/)

#### Depth-first search
- [Notes - DAA HT23, Depth-first search](https://ollybritton.com/notes/uni/prelims/ht23/daa/notes/depth-first-search/)

#### Topological sort
- [Notes - DAA HT23, Depth-first search](https://ollybritton.com/notes/uni/prelims/ht23/daa/notes/depth-first-search/)

#### Strongly connected components
- [Notes - DAA HT23, Strongly connected components](https://ollybritton.com/notes/uni/prelims/ht23/daa/notes/strongly-connected-components/)

### Minimum spanning trees
- [Notes - DAA HT23, Spanning trees](https://ollybritton.com/notes/uni/prelims/ht23/daa/notes/spanning-trees/)

#### “Generic MST”
#### Kruskals algorithm
#### Prim’s algorithm

### Shortest paths
- [Notes - DAA HT23, Shortest paths and relaxation](https://ollybritton.com/notes/uni/prelims/ht23/daa/notes/shortest-paths-and-relaxation/)

#### Bellman-Ford algorithm
#### Shortest paths in a DAG
#### Dijkstra’s algorithm
#### Floyd-Warshall algorithm

### Heaps
[Notes - DAA HT23, Heaps](https://ollybritton.com/notes/uni/prelims/ht23/daa/notes/heaps/)

#### Max-Heapify
#### Make-Max-Heap
#### Insert
#### Increase-Key
#### Extract-Min

### Sorting and selecting
#### Partition
- [Notes - DAA HT23, Sorting](https://ollybritton.com/notes/uni/prelims/ht23/daa/notes/sorting/)
#### Quicksort
#### Quickselect

---
Olly Britton — https://ollybritton.com. Machine-readable index: https://ollybritton.com/llms.txt