Algorithms-Stanford

KO | EN

gitlite — search

#javascript #python #hacktoberfest #react #machine-learning #linux #java #windows #awesome #cli #kubernetes #pytorch #security #mcp

Algorithms-Stanford

(★ 28)

📚 Algorithms Specialization by Stanford University

Algorithms-Stanford 최신버젼 다운로드

최종 버전 다운로드 (.zip)

// repository documentation

Was this content helpful?

★ 0 (0 ratings)

# Algorithms-Stanford

![Can We Do Better?](https://raw.githubusercontent.com/claytonjwong/Algorithms-Stanford/master/documentation/can_we_do_better.png)
## Can we do better?... [$1,000,000](https://en.wikipedia.org/wiki/Millennium_Prize_Problems#P_versus_NP)

### Course 1: Divide and Conquer, Sorting and Searching, and Randomized Algorithms
  * [Introduction, Guiding Principles, and Asymptotic Analysis](https://github.com/claytonjwong/Algorithms-Stanford/tree/master/documentation/introduction)
  * [Master Theorem](https://github.com/claytonjwong/Algorithms-Stanford/tree/master/documentation/master_theorem)
  * [Karatsuba Multiplication ( trivial templates )](https://github.com/claytonjwong/Algorithms-Stanford/tree/master/course1/karatsuba_multiplication)
  * [Karatsuba Multiplication ( non-trivial strings )](https://github.com/claytonjwong/Algorithms-Stanford/tree/master/course1/karatsuba_multi_string)
  * [Merge Sort](https://github.com/claytonjwong/Algorithms-Stanford/tree/master/course1/merge_sort)
  * [Array Inversions](https://github.com/claytonjwong/Algorithms-Stanford/tree/master/course1/array_inversions)
  * Strassen's Matrix Multiplication
  * Closest Pair ( minimal Euclidean distance between two points in a 2-D plane )
  * [Randomized Quick Sort](https://github.com/claytonjwong/Algorithms-Stanford/tree/master/course1/quick_sort)
  * [Randomized Linear Selection](https://github.com/claytonjwong/Algorithms-Stanford/tree/master/course1/r_select)
  * Deterministic Linear Selection
  * [Karger Minimum Cut ( Randomized Edge Contractions ) < Monte Carlo >](https://github.com/claytonjwong/Algorithms-Stanford/tree/master/course1/karger_min_cut)
  
### Course 2: Graph Search, Shortest Paths, and Data Structures
  * [Introduction, Graph Representations, Primitives, and the Web](https://github.com/claytonjwong/Algorithms-Stanford/tree/master/documentation/graphs)
  * [Breadth First Search ( BFS )](https://github.com/claytonjwong/Algorithms-Stanford/tree/master/course2/bfs)
  * [Minimum Path Distances ( BFS )](https://github.com/claytonjwong/Algorithms-Stanford/tree/master/course2/bfs_min_path_dist)
  * [Depth First Search ( DFS - Iterative )](https://github.com/claytonjwong/Algorithms-Stanford/tree/master/course2/dfs)
  * [Depth First Search ( DFS - Recursive )](https://github.com/claytonjwong/Algorithms-Stanford/tree/master/course2/dfs_rec)
  * [Topological Sort ( DFS )](https://github.com/claytonjwong/Algorithms-Stanford/tree/master/course2/topo_sort)
  * [Topological Sort ( BFS )](https://github.com/claytonjwong/Algorithms-Stanford/tree/master/course2/topo_sort_prune_bfs)
  * [Undirected Connected Components ( BFS )](https://github.com/claytonjwong/Algorithms-Stanford/tree/master/course2/ucc)
  * [Kosaraju ( DFS + DFS - Recursive )](https://github.com/claytonjwong/Algorithms-Stanford/tree/master/course2/kosaraju_rec)
  * [Kosaraju ( DFS + DFS - Iterative )](https://github.com/claytonjwong/Algorithms-Stanford/tree/master/course2/kosaraju_itr)
  * [Dijkstra ( priority queue )](https://github.com/claytonjwong/Algorithms-Stanford/tree/master/course2/dijkstra)
  * [Heap ( sort + median )](https://github.com/claytonjwong/Algorithms-Stanford/tree/master/course2/heap)
  * Search Trees
  * [Two Sum ( hash table )](https://github.com/claytonjwong/Algorithms-Stanford/tree/master/course2/two_sum)
  
### Course 3: Greedy Algorithms, Minimum Spanning Trees, Dynamic Programming
  * [Introduction and Motivating Applications](https://github.com/claytonjwong/Algorithms-Stanford/tree/master/documentation/greedy_mst_dp)
  * [LRU Cache](https://github.com/claytonjwong/Algorithms-Stanford/tree/master/course3/LRU_cache)
  * [Job Scheduler ( Minimum Weighted Sum of Completion Times )](https://github.com/claytonjwong/Algorithms-Stanford/tree/master/course3/schedule_jobs)
  * [Prim ( trivial search in O( N^2 ) time )](https://github.com/claytonjwong/Algorithms-Stanford/tree/master/course3/prim_mst)
  * Prim - Minimum Spanning Tree ( MST ) ( non-trivial with heap in O( (M+N)log(N) ) time )
  * [Kruskal](https://github.com/claytonjwong/Algorithms-Stanford/tree/master/course3/kruskal_mst)
  * Boruvka - Minimum Spanning Tree ( MST ) ( Union-Find + Path Compression )
  * Karger, Klein, Tarjan - Randomized Minimum Spanning Forest ( relies on adaptation of Boruvka's algorithm ) 
  * [K-Clustering](https://github.com/claytonjwong/Algorithms-Stanford/tree/master/course3/clustering)
  * [Huffman Coding](https://github.com/claytonjwong/Algorithms-Stanford/tree/master/course3/huffman)
  * [Maximum Independent Set](https://github.com/claytonjwong/Algorithms-Stanford/tree/master/course3/max_independent_set)
  * [Knapsack](https://github.com/claytonjwong/Algorithms-Stanford/tree/master/course3/knapsack)
  * [Sequence Alignment ( Needleman-Wunsch score )](https://github.com/claytonjwong/Algorithms-Stanford/tree/master/course3/sequence_alignment)
  * Optimal Binary Search Trees
  
### Course 4: Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
  * [Introduction, All-Pairs Shortest Paths (APSP), Algorithmic Approaches to NP-Complete Problems](https://github.com/claytonjwong/Algorithms-Stanford/tree/master/documentation/apsp_npc)
  * [Bellman Ford](https://github.com/claytonjwong/Algorithms-Stanford/tree/master/course4/bellman_ford)
  * [Bellman Ford ( memory optimized + cycle detection )](https://github.com/claytonjwong/Algorithms-Stanford/tree/master/course4/bellman_ford_memopt)
  * [Floyd Warshall](https://github.com/claytonjwong/Algorithms-Stanford/tree/master/course4/floyd_warshall)
  * [Floyd Warshall ( memory optimized )](https://github.com/claytonjwong/Algorithms-Stanford/tree/master/course4/floyd_warshall_memopt)
  * [Floyd Warshall ( memory optimized + transitive closure )](https://github.com/claytonjwong/Algorithms-Stanford/tree/master/course4/transitive_closure)
  * [Johnson](https://github.com/claytonjwong/Algorithms-Stanford/tree/master/course4/johnson)
  * [Vertex Cover ( min K graph )](https://github.com/claytonjwong/Algorithms-Stanford/tree/master/course4/vertex_cover_k_graph)
  * [Vertex Cover ( min K tree )](https://github.com/claytonjwong/Algorithms-Stanford/tree/master/course4/vertex_cover_k_tree)
  * [Travelling Salesman](https://github.com/claytonjwong/Algorithms-Stanford/tree/master/course4/travelling_salesman)
  * [Travelling Salesman ( heuristic )](https://github.com/claytonjwong/Algorithms-Stanford/tree/master/course4/travelling_salesman_nn)
  * Knapsack ( heuristic )
  * [Max Cut ( bipartite graph )](https://github.com/claytonjwong/Algorithms-Stanford/tree/master/course4/bipartite_graph)
  * [2-SAT ( Papadimitriou random flips )](https://github.com/claytonjwong/Algorithms-Stanford/tree/master/course4/2sat)
  * [2-SAT ( Kosaraju SCC )](https://github.com/claytonjwong/Algorithms-Stanford/tree/master/course4/2sat_scc)

### Supplemental Resources
  * [Master-Theorem](https://claytonjwong.github.io/Master-Theorem/)
  * [Algorithms: Dasgupta-Papadimitriou-Vazirani ( 2006 )](https://github.com/claytonjwong/Algorithms-Stanford/tree/master/documentation/Dasgupta-Papadimitriou-Vazirani.pdf)
  * [Algorithms and Data Structures: Mehlhorn-Sanders ( 2007 )](https://github.com/claytonjwong/Algorithms-Stanford/tree/master/documentation/Mehlhorn-Sanders-Toolbox.pdf)
  * Introduction to Algorithms: Cormen-Leiserson-Rivest-Stein ( 2009 )
  * [Discrete Probability](https://en.wikibooks.org/wiki/High_School_Mathematics_Extensions/Discrete_Probability)
  * [Mathematical Proofs](https://en.wikibooks.org/wiki/High_School_Mathematics_Extensions/Mathematical_Proofs)

Algorithms-Stanford

Algorithms-Stanford 최신버젼 다운로드

오늘의 추천 프로젝트

Was this content helpful?

Recent Feedback

Algorithms-Stanford

Algorithms-Stanford 최신버젼 다운로드

오늘의 추천 프로젝트

Was this content helpful?

Recent Feedback

Download README