Algorithms

Section 2b: Analysis of Algorithms

  1. Analysis Framework
    1. Asymptotic notations: big-oh, little-oh, big theta, big omega, little omega
    2. Worst-case, best-case, average-case analysis of algorithms
  2. Recursive Functions and Recurrence Relations
  3. Graph Algorithms
    1. Kruskal's algorithm and Prim's algorithm
    2. Dijkstra's algorithm
    3. Breadth-first search (BFS) and depth-first search (DFS).
  4. Analysis of fundamental algorithms such as searching and sorting