connor-mccarthy / algorithms-specialization-stanford

Code and notes for the Stanford Algorithms Specialization course.

Stanford Algorithms Specialization

Code and notes for the Algorithms Specialization course offered by Stanford University.

Algorithms

Course 1

• Karatsuba multiplication
• Merge sort
• Inversion counter
• Strassens matrix multiplication
• Quicksort
• Randomized selection
• Random contraction

Course 2

• Breadth first graph search (BFS)
• BFS for computing shortest path
• Depth first graph search (DFS)
• DFS for computing topological ordering of DAG
• Kosaraju's two-pass for computing strongly connected graph components
• Dijkstra's shortest path
• Median maintenance via heaps
• TwoSum via hash table

Course 3

• Greedy scheduling algorithm
• Prim's minimum spanning tree algorithm
• Kruskal's minimum spanning tree algorithm
• Maximally spaced k-clustering
• Huffman optimal binary prefix-free encoding
• Max weight independent set in path graph
• The knapsack problem

Certificates

Course 1

Course 2

Course 3