https://github.com/connor-mccarthy/algorithms-specialization-stanford

Code and notes for the Stanford Algorithms Specialization course.
https://github.com/connor-mccarthy/algorithms-specialization-stanford

algorithms divide-and-conquer graph-search graphs python search-algorithm sort-algorithm stanford-algorithms-specialization

Last synced: 29 days ago
JSON representation

Code and notes for the Stanford Algorithms Specialization course.

• Host: GitHub
• URL: https://github.com/connor-mccarthy/algorithms-specialization-stanford
• Owner: connor-mccarthy
• Created: 2021-01-28T03:46:33.000Z (almost 4 years ago)
• Default Branch: master
• Last Pushed: 2022-01-31T21:29:25.000Z (almost 3 years ago)
• Last Synced: 2024-10-14T09:35:50.291Z (2 months ago)
• Topics: algorithms, divide-and-conquer, graph-search, graphs, python, search-algorithm, sort-algorithm, stanford-algorithms-specialization
• Language: Python
• Homepage:
• Size: 25.9 MB
• Stars: 3
• Watchers: 1
• Forks: 1
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        


  
Stanford Algorithms Specialization






    





    





    





    





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





Algorithms



### Course 1

- [Karatsuba multiplication](./src/course1/week1/karatsuba/karatsuba.py)

- [Merge sort](./src/course1/week1/merge_sort/merge_sort.py)

- [Inversion counter](./src/course1/week2/inversion_counter/inversion_counter.py)

- [Strassens matrix multiplication](./src/course1/week2/strassens_matrix_multiplication/strassens.py)

- [Quicksort](./src/course1/week3/quicksort/quicksort.py)

- [Randomized selection](./src/course1/week4/randomized_selection/randomized_selection.py)

- [Random contraction](./src/course1/week4/graphs/random_contraction/random_contraction.py)

### Course 2

- [Breadth first graph search (BFS)](./src/course2/week1/breadth_first_search/basic/bfs.py)

- [BFS for computing shortest path](./src/course2/week1/breadth_first_search/shortest_path/shortest_path.py)

- [Depth first graph search (DFS)](./src/course2/week1/depth_first_search/basic/dfs.py)

- [DFS for computing topological ordering of DAG](./src/course2/week1/depth_first_search/topological_ordering/topological_ordering.py)

- [Kosaraju's two-pass for computing strongly connected graph components](./src/course2/week1/strongly_connected_components/kosaraju.py)

- [Dijkstra's shortest path](./src/course2/week2/dijkstra.py)

- [Median maintenance via heaps](./src/course2/week3/median_maintenance_assignment/median_maintenance_assignment.py)

- [TwoSum via hash table](./src/course2/week4/two_sum.py)

### Course 3

- [Greedy scheduling algorithm](./src/course3/week1/scheduling/scheduler.py)

- [Prim's minimum spanning tree algorithm](./src/course3/week1/prims_mst/prims.py)

- [Kruskal's minimum spanning tree algorithm](./src/course3/week2/kruskal/kruskal.py)

- [Maximally spaced k-clustering](./src/course3/week2/clustering/clustering.py)

- [Huffman optimal binary prefix-free encoding](./src/course3/week3/huffman_codes/huffman.py)

- [Max weight independent set in path graph](./src/course3/week3/dynamic_programming/wis.py)

- [The knapsack problem](./src/course3/week4/knapsack_problem/knapsack.py)



Certificates



[Course 1](./src/course1/course1_certificate.pdf)

[Course 2](./src/course2/course2_certificate.pdf)

[Course 3](./src/course3/course3_certificate.pdf)