List of algorithms to memorise for DAA

Created: June 11, 2023

---

• [[Course - Design and Analysis of Algorithms HT23]]^U

Elementary graph algorithms

Breadth-first search

• [[Notes - DAA HT23, Breadth-first search]]^U

Depth-first search

• [[Notes - DAA HT23, Depth-first search]]^U

Topological sort

• [[Notes - DAA HT23, Depth-first search]]^U

Strongly connected components

• [[Notes - DAA HT23, Strongly connected components]]^U

Minimum spanning trees

• [[Notes - DAA HT23, Minimum spanning trees]]^U

“Generic MST”

Kruskals algorithm

Prim’s algorithm

Shortest paths

• [[Notes - DAA HT23, Shortest paths and relaxation]]^U

Bellman-Ford algorithm

Shortest paths in a DAG

Dijkstra’s algorithm

Floyd-Warshall algorithm

Heaps

[[Notes - DAA HT23, Heaps]]^U

Max-Heapify

Make-Max-Heap

Insert

Increase-Key

Extract-Min

Sorting and selecting

Partition

• [[Notes - DAA HT23, Sorting]]^U

  Quicksort

  Quickselect

---

Related posts

• [[Course - Design and Analysis of Algorithms HT23]]^U

  (outgoing)
• [[Notes - DAA HT23, Breadth-first search]]^U

  (outgoing)
• [[Notes - DAA HT23, Depth-first search]]^U

  (outgoing)
• [[Notes - DAA HT23, Strongly connected components]]^U

  (outgoing)
• [[Notes - DAA HT23, Minimum spanning trees]]^U

  (outgoing)
• [[Notes - DAA HT23, Shortest paths and relaxation]]^U

  (outgoing)
• [[Notes - DAA HT23, Heaps]]^U

  (outgoing)
• [[Notes - DAA HT23, Sorting]]^U

  (outgoing)
• [[Lecture - DAA HT23, XIV]]^U

  (sim: 0.666)
• [[Lecture - DAA HT23, XI]]^U

  (sim: 0.666)
• [[Lecture - DAA HT23, XIII]]^U

  (sim: 0.666)
• [[Lecture - DAA HT23, XII]]^U

  (sim: 0.666)