├── LICENSE ├── Lecture Slides ├── 17.1-algo2-intro-routing-typed.pdf ├── 17.2-algo2-intro-alignment-typed.pdf ├── 18.1-algo2-greedy-intro-typed.pdf ├── 18.2-algo2-greedy-fif-typed.pdf ├── 19.1-algo2-greedy-sched1-typed.pdf ├── 19.2-algo2-greedy-sched2-typed.pdf ├── 19.3-algo2-greedy-sched3-typed.pdf ├── 19.4-algo2-greedy-sched4-typed.pdf ├── 19.5-algo2-greedy-sched5-typed.pdf ├── 20.1-algo2-greedy-mst1-typed.pdf ├── 20.2-algo2-greedy-mst2-typed.pdf ├── 20.3-algo2-greedy-mst3-typed.pdf ├── 20.4-algo2-greedy-mst4-typed.pdf ├── 20.5-algo2-greedy-mst5-typed.pdf ├── 20.6-algo2-greedy-mst6-typed.pdf ├── 21.1-algo2-greedy-kruskal1-typed.pdf ├── 21.2-algo2-greedy-kruskal2-typed.pdf ├── 21.3-algo2-greedy-kruskal3-typed.pdf ├── 21.5-algo2-greedy-kruskal4-typed.pdf ├── 22.1-algo2-greedy-kruskal5-typed.pdf ├── 22.2-algo2-greedy-kruskal6-typed.pdf ├── 23.1-algo2-greedy-union-find1-typed.pdf ├── 23.2-algo2-greedy-union-find2-typed.pdf ├── 23.3-algo2-greedy-union-find3-typed.pdf ├── 24.1-algo2-greedy-huffman1-typed.pdf ├── 24.2-algo2-greedy-huffman2-typed.pdf ├── 24.3-algo2-greedy-huffman3-typed.pdf ├── 24.4-algo2-greedy-huffman4-typed.pdf ├── 24.5-algo2-greedy-huffman5-typed.pdf ├── 25.1-algo2-dp-wis1-typed.pdf ├── 25.2-algo2-dp-wis2-typed.pdf ├── 25.3-algo2-dp-wis3-typed.pdf ├── 25.4-algo2-dp-wis4-typed.pdf ├── 25.5-algo2-dp-wis5-typed.pdf ├── 26.1-algo2-dp-knapsack1-typed.pdf ├── 26.2-algo2-dp-knapsack2-typed.pdf ├── 26.3-algo2-knapsack-example-typed.pdf ├── 27.1-algo2-dp-alignment1-typed.pdf ├── 27.2-algo2-dp-alignment2-typed.pdf ├── 28.1-algo2-dp-bst1-typed.pdf ├── 28.2-algo2-dp-bst2-typed.pdf ├── 28.4-algo2-dp-bst3-typed.pdf └── README.md ├── Programming Assignment 1 ├── README.md ├── edges.txt ├── greedyalgorithm.html ├── greedyalgorithm.ipynb └── jobs.txt ├── Programming Assignment 2 ├── Cluster 1.html ├── Cluster 1.ipynb ├── Cluster 2.html ├── Cluster 2.ipynb ├── Clusteringtest.html ├── Clusteringtest.ipynb ├── README.md ├── clustering1.txt └── clustering_big.txt ├── Programming Assignment 3 ├── DynamicProgramming.html ├── DynamicProgramming.ipynb ├── HuffmanCoding.html ├── HuffmanCoding.ipynb ├── README.md ├── huffman.txt └── mwis.txt ├── Programming Assignment 4 ├── README.md ├── knapsack1.html ├── knapsack1.ipynb ├── knapsack1.txt ├── knapsack_big.html ├── knapsack_big.ipynb └── knapsack_big.txt └── README.md /LICENSE: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SSQ/Coursera-Stanford-Greedy-Algorithms-Minimum-Spanning-Trees-and-Dynamic-Programming/HEAD/LICENSE -------------------------------------------------------------------------------- /Lecture Slides/17.1-algo2-intro-routing-typed.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SSQ/Coursera-Stanford-Greedy-Algorithms-Minimum-Spanning-Trees-and-Dynamic-Programming/HEAD/Lecture Slides/17.1-algo2-intro-routing-typed.pdf -------------------------------------------------------------------------------- /Lecture Slides/17.2-algo2-intro-alignment-typed.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SSQ/Coursera-Stanford-Greedy-Algorithms-Minimum-Spanning-Trees-and-Dynamic-Programming/HEAD/Lecture Slides/17.2-algo2-intro-alignment-typed.pdf -------------------------------------------------------------------------------- /Lecture Slides/18.1-algo2-greedy-intro-typed.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SSQ/Coursera-Stanford-Greedy-Algorithms-Minimum-Spanning-Trees-and-Dynamic-Programming/HEAD/Lecture Slides/18.1-algo2-greedy-intro-typed.pdf -------------------------------------------------------------------------------- /Lecture Slides/18.2-algo2-greedy-fif-typed.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SSQ/Coursera-Stanford-Greedy-Algorithms-Minimum-Spanning-Trees-and-Dynamic-Programming/HEAD/Lecture Slides/18.2-algo2-greedy-fif-typed.pdf -------------------------------------------------------------------------------- /Lecture Slides/19.1-algo2-greedy-sched1-typed.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SSQ/Coursera-Stanford-Greedy-Algorithms-Minimum-Spanning-Trees-and-Dynamic-Programming/HEAD/Lecture Slides/19.1-algo2-greedy-sched1-typed.pdf -------------------------------------------------------------------------------- /Lecture Slides/19.2-algo2-greedy-sched2-typed.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SSQ/Coursera-Stanford-Greedy-Algorithms-Minimum-Spanning-Trees-and-Dynamic-Programming/HEAD/Lecture Slides/19.2-algo2-greedy-sched2-typed.pdf -------------------------------------------------------------------------------- /Lecture Slides/19.3-algo2-greedy-sched3-typed.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SSQ/Coursera-Stanford-Greedy-Algorithms-Minimum-Spanning-Trees-and-Dynamic-Programming/HEAD/Lecture Slides/19.3-algo2-greedy-sched3-typed.pdf -------------------------------------------------------------------------------- /Lecture Slides/19.4-algo2-greedy-sched4-typed.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SSQ/Coursera-Stanford-Greedy-Algorithms-Minimum-Spanning-Trees-and-Dynamic-Programming/HEAD/Lecture Slides/19.4-algo2-greedy-sched4-typed.pdf -------------------------------------------------------------------------------- /Lecture Slides/19.5-algo2-greedy-sched5-typed.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SSQ/Coursera-Stanford-Greedy-Algorithms-Minimum-Spanning-Trees-and-Dynamic-Programming/HEAD/Lecture Slides/19.5-algo2-greedy-sched5-typed.pdf -------------------------------------------------------------------------------- /Lecture Slides/20.1-algo2-greedy-mst1-typed.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SSQ/Coursera-Stanford-Greedy-Algorithms-Minimum-Spanning-Trees-and-Dynamic-Programming/HEAD/Lecture Slides/20.1-algo2-greedy-mst1-typed.pdf -------------------------------------------------------------------------------- /Lecture Slides/20.2-algo2-greedy-mst2-typed.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SSQ/Coursera-Stanford-Greedy-Algorithms-Minimum-Spanning-Trees-and-Dynamic-Programming/HEAD/Lecture Slides/20.2-algo2-greedy-mst2-typed.pdf -------------------------------------------------------------------------------- /Lecture Slides/20.3-algo2-greedy-mst3-typed.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SSQ/Coursera-Stanford-Greedy-Algorithms-Minimum-Spanning-Trees-and-Dynamic-Programming/HEAD/Lecture Slides/20.3-algo2-greedy-mst3-typed.pdf -------------------------------------------------------------------------------- /Lecture Slides/20.4-algo2-greedy-mst4-typed.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SSQ/Coursera-Stanford-Greedy-Algorithms-Minimum-Spanning-Trees-and-Dynamic-Programming/HEAD/Lecture Slides/20.4-algo2-greedy-mst4-typed.pdf -------------------------------------------------------------------------------- /Lecture Slides/20.5-algo2-greedy-mst5-typed.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SSQ/Coursera-Stanford-Greedy-Algorithms-Minimum-Spanning-Trees-and-Dynamic-Programming/HEAD/Lecture Slides/20.5-algo2-greedy-mst5-typed.pdf -------------------------------------------------------------------------------- /Lecture Slides/20.6-algo2-greedy-mst6-typed.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SSQ/Coursera-Stanford-Greedy-Algorithms-Minimum-Spanning-Trees-and-Dynamic-Programming/HEAD/Lecture Slides/20.6-algo2-greedy-mst6-typed.pdf -------------------------------------------------------------------------------- /Lecture Slides/21.1-algo2-greedy-kruskal1-typed.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SSQ/Coursera-Stanford-Greedy-Algorithms-Minimum-Spanning-Trees-and-Dynamic-Programming/HEAD/Lecture Slides/21.1-algo2-greedy-kruskal1-typed.pdf -------------------------------------------------------------------------------- /Lecture Slides/21.2-algo2-greedy-kruskal2-typed.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SSQ/Coursera-Stanford-Greedy-Algorithms-Minimum-Spanning-Trees-and-Dynamic-Programming/HEAD/Lecture Slides/21.2-algo2-greedy-kruskal2-typed.pdf -------------------------------------------------------------------------------- /Lecture Slides/21.3-algo2-greedy-kruskal3-typed.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SSQ/Coursera-Stanford-Greedy-Algorithms-Minimum-Spanning-Trees-and-Dynamic-Programming/HEAD/Lecture Slides/21.3-algo2-greedy-kruskal3-typed.pdf -------------------------------------------------------------------------------- /Lecture Slides/21.5-algo2-greedy-kruskal4-typed.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SSQ/Coursera-Stanford-Greedy-Algorithms-Minimum-Spanning-Trees-and-Dynamic-Programming/HEAD/Lecture Slides/21.5-algo2-greedy-kruskal4-typed.pdf -------------------------------------------------------------------------------- /Lecture Slides/22.1-algo2-greedy-kruskal5-typed.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SSQ/Coursera-Stanford-Greedy-Algorithms-Minimum-Spanning-Trees-and-Dynamic-Programming/HEAD/Lecture Slides/22.1-algo2-greedy-kruskal5-typed.pdf -------------------------------------------------------------------------------- /Lecture Slides/22.2-algo2-greedy-kruskal6-typed.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SSQ/Coursera-Stanford-Greedy-Algorithms-Minimum-Spanning-Trees-and-Dynamic-Programming/HEAD/Lecture Slides/22.2-algo2-greedy-kruskal6-typed.pdf -------------------------------------------------------------------------------- /Lecture Slides/23.1-algo2-greedy-union-find1-typed.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SSQ/Coursera-Stanford-Greedy-Algorithms-Minimum-Spanning-Trees-and-Dynamic-Programming/HEAD/Lecture Slides/23.1-algo2-greedy-union-find1-typed.pdf -------------------------------------------------------------------------------- /Lecture Slides/23.2-algo2-greedy-union-find2-typed.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SSQ/Coursera-Stanford-Greedy-Algorithms-Minimum-Spanning-Trees-and-Dynamic-Programming/HEAD/Lecture Slides/23.2-algo2-greedy-union-find2-typed.pdf -------------------------------------------------------------------------------- /Lecture Slides/23.3-algo2-greedy-union-find3-typed.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SSQ/Coursera-Stanford-Greedy-Algorithms-Minimum-Spanning-Trees-and-Dynamic-Programming/HEAD/Lecture Slides/23.3-algo2-greedy-union-find3-typed.pdf -------------------------------------------------------------------------------- /Lecture Slides/24.1-algo2-greedy-huffman1-typed.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SSQ/Coursera-Stanford-Greedy-Algorithms-Minimum-Spanning-Trees-and-Dynamic-Programming/HEAD/Lecture Slides/24.1-algo2-greedy-huffman1-typed.pdf -------------------------------------------------------------------------------- /Lecture Slides/24.2-algo2-greedy-huffman2-typed.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SSQ/Coursera-Stanford-Greedy-Algorithms-Minimum-Spanning-Trees-and-Dynamic-Programming/HEAD/Lecture Slides/24.2-algo2-greedy-huffman2-typed.pdf -------------------------------------------------------------------------------- /Lecture Slides/24.3-algo2-greedy-huffman3-typed.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SSQ/Coursera-Stanford-Greedy-Algorithms-Minimum-Spanning-Trees-and-Dynamic-Programming/HEAD/Lecture Slides/24.3-algo2-greedy-huffman3-typed.pdf -------------------------------------------------------------------------------- /Lecture Slides/24.4-algo2-greedy-huffman4-typed.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SSQ/Coursera-Stanford-Greedy-Algorithms-Minimum-Spanning-Trees-and-Dynamic-Programming/HEAD/Lecture Slides/24.4-algo2-greedy-huffman4-typed.pdf -------------------------------------------------------------------------------- /Lecture Slides/24.5-algo2-greedy-huffman5-typed.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SSQ/Coursera-Stanford-Greedy-Algorithms-Minimum-Spanning-Trees-and-Dynamic-Programming/HEAD/Lecture Slides/24.5-algo2-greedy-huffman5-typed.pdf -------------------------------------------------------------------------------- /Lecture Slides/25.1-algo2-dp-wis1-typed.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SSQ/Coursera-Stanford-Greedy-Algorithms-Minimum-Spanning-Trees-and-Dynamic-Programming/HEAD/Lecture Slides/25.1-algo2-dp-wis1-typed.pdf -------------------------------------------------------------------------------- /Lecture Slides/25.2-algo2-dp-wis2-typed.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SSQ/Coursera-Stanford-Greedy-Algorithms-Minimum-Spanning-Trees-and-Dynamic-Programming/HEAD/Lecture Slides/25.2-algo2-dp-wis2-typed.pdf -------------------------------------------------------------------------------- /Lecture Slides/25.3-algo2-dp-wis3-typed.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SSQ/Coursera-Stanford-Greedy-Algorithms-Minimum-Spanning-Trees-and-Dynamic-Programming/HEAD/Lecture Slides/25.3-algo2-dp-wis3-typed.pdf -------------------------------------------------------------------------------- /Lecture Slides/25.4-algo2-dp-wis4-typed.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SSQ/Coursera-Stanford-Greedy-Algorithms-Minimum-Spanning-Trees-and-Dynamic-Programming/HEAD/Lecture Slides/25.4-algo2-dp-wis4-typed.pdf -------------------------------------------------------------------------------- /Lecture Slides/25.5-algo2-dp-wis5-typed.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SSQ/Coursera-Stanford-Greedy-Algorithms-Minimum-Spanning-Trees-and-Dynamic-Programming/HEAD/Lecture Slides/25.5-algo2-dp-wis5-typed.pdf -------------------------------------------------------------------------------- /Lecture Slides/26.1-algo2-dp-knapsack1-typed.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SSQ/Coursera-Stanford-Greedy-Algorithms-Minimum-Spanning-Trees-and-Dynamic-Programming/HEAD/Lecture Slides/26.1-algo2-dp-knapsack1-typed.pdf -------------------------------------------------------------------------------- /Lecture Slides/26.2-algo2-dp-knapsack2-typed.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SSQ/Coursera-Stanford-Greedy-Algorithms-Minimum-Spanning-Trees-and-Dynamic-Programming/HEAD/Lecture Slides/26.2-algo2-dp-knapsack2-typed.pdf -------------------------------------------------------------------------------- /Lecture Slides/26.3-algo2-knapsack-example-typed.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SSQ/Coursera-Stanford-Greedy-Algorithms-Minimum-Spanning-Trees-and-Dynamic-Programming/HEAD/Lecture Slides/26.3-algo2-knapsack-example-typed.pdf -------------------------------------------------------------------------------- /Lecture Slides/27.1-algo2-dp-alignment1-typed.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SSQ/Coursera-Stanford-Greedy-Algorithms-Minimum-Spanning-Trees-and-Dynamic-Programming/HEAD/Lecture Slides/27.1-algo2-dp-alignment1-typed.pdf -------------------------------------------------------------------------------- /Lecture Slides/27.2-algo2-dp-alignment2-typed.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SSQ/Coursera-Stanford-Greedy-Algorithms-Minimum-Spanning-Trees-and-Dynamic-Programming/HEAD/Lecture Slides/27.2-algo2-dp-alignment2-typed.pdf -------------------------------------------------------------------------------- /Lecture Slides/28.1-algo2-dp-bst1-typed.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SSQ/Coursera-Stanford-Greedy-Algorithms-Minimum-Spanning-Trees-and-Dynamic-Programming/HEAD/Lecture Slides/28.1-algo2-dp-bst1-typed.pdf -------------------------------------------------------------------------------- /Lecture Slides/28.2-algo2-dp-bst2-typed.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SSQ/Coursera-Stanford-Greedy-Algorithms-Minimum-Spanning-Trees-and-Dynamic-Programming/HEAD/Lecture Slides/28.2-algo2-dp-bst2-typed.pdf -------------------------------------------------------------------------------- /Lecture Slides/28.4-algo2-dp-bst3-typed.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SSQ/Coursera-Stanford-Greedy-Algorithms-Minimum-Spanning-Trees-and-Dynamic-Programming/HEAD/Lecture Slides/28.4-algo2-dp-bst3-typed.pdf -------------------------------------------------------------------------------- /Lecture Slides/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SSQ/Coursera-Stanford-Greedy-Algorithms-Minimum-Spanning-Trees-and-Dynamic-Programming/HEAD/Lecture Slides/README.md -------------------------------------------------------------------------------- /Programming Assignment 1/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SSQ/Coursera-Stanford-Greedy-Algorithms-Minimum-Spanning-Trees-and-Dynamic-Programming/HEAD/Programming Assignment 1/README.md -------------------------------------------------------------------------------- /Programming Assignment 1/edges.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SSQ/Coursera-Stanford-Greedy-Algorithms-Minimum-Spanning-Trees-and-Dynamic-Programming/HEAD/Programming Assignment 1/edges.txt -------------------------------------------------------------------------------- /Programming Assignment 1/greedyalgorithm.html: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SSQ/Coursera-Stanford-Greedy-Algorithms-Minimum-Spanning-Trees-and-Dynamic-Programming/HEAD/Programming Assignment 1/greedyalgorithm.html -------------------------------------------------------------------------------- /Programming Assignment 1/greedyalgorithm.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SSQ/Coursera-Stanford-Greedy-Algorithms-Minimum-Spanning-Trees-and-Dynamic-Programming/HEAD/Programming Assignment 1/greedyalgorithm.ipynb -------------------------------------------------------------------------------- /Programming Assignment 1/jobs.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SSQ/Coursera-Stanford-Greedy-Algorithms-Minimum-Spanning-Trees-and-Dynamic-Programming/HEAD/Programming Assignment 1/jobs.txt -------------------------------------------------------------------------------- /Programming Assignment 2/Cluster 1.html: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SSQ/Coursera-Stanford-Greedy-Algorithms-Minimum-Spanning-Trees-and-Dynamic-Programming/HEAD/Programming Assignment 2/Cluster 1.html -------------------------------------------------------------------------------- /Programming Assignment 2/Cluster 1.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SSQ/Coursera-Stanford-Greedy-Algorithms-Minimum-Spanning-Trees-and-Dynamic-Programming/HEAD/Programming Assignment 2/Cluster 1.ipynb -------------------------------------------------------------------------------- /Programming Assignment 2/Cluster 2.html: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SSQ/Coursera-Stanford-Greedy-Algorithms-Minimum-Spanning-Trees-and-Dynamic-Programming/HEAD/Programming Assignment 2/Cluster 2.html -------------------------------------------------------------------------------- /Programming Assignment 2/Cluster 2.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SSQ/Coursera-Stanford-Greedy-Algorithms-Minimum-Spanning-Trees-and-Dynamic-Programming/HEAD/Programming Assignment 2/Cluster 2.ipynb -------------------------------------------------------------------------------- /Programming Assignment 2/Clusteringtest.html: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SSQ/Coursera-Stanford-Greedy-Algorithms-Minimum-Spanning-Trees-and-Dynamic-Programming/HEAD/Programming Assignment 2/Clusteringtest.html -------------------------------------------------------------------------------- /Programming Assignment 2/Clusteringtest.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SSQ/Coursera-Stanford-Greedy-Algorithms-Minimum-Spanning-Trees-and-Dynamic-Programming/HEAD/Programming Assignment 2/Clusteringtest.ipynb -------------------------------------------------------------------------------- /Programming Assignment 2/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SSQ/Coursera-Stanford-Greedy-Algorithms-Minimum-Spanning-Trees-and-Dynamic-Programming/HEAD/Programming Assignment 2/README.md -------------------------------------------------------------------------------- /Programming Assignment 2/clustering1.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SSQ/Coursera-Stanford-Greedy-Algorithms-Minimum-Spanning-Trees-and-Dynamic-Programming/HEAD/Programming Assignment 2/clustering1.txt -------------------------------------------------------------------------------- /Programming Assignment 2/clustering_big.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SSQ/Coursera-Stanford-Greedy-Algorithms-Minimum-Spanning-Trees-and-Dynamic-Programming/HEAD/Programming Assignment 2/clustering_big.txt -------------------------------------------------------------------------------- /Programming Assignment 3/DynamicProgramming.html: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SSQ/Coursera-Stanford-Greedy-Algorithms-Minimum-Spanning-Trees-and-Dynamic-Programming/HEAD/Programming Assignment 3/DynamicProgramming.html -------------------------------------------------------------------------------- /Programming Assignment 3/DynamicProgramming.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SSQ/Coursera-Stanford-Greedy-Algorithms-Minimum-Spanning-Trees-and-Dynamic-Programming/HEAD/Programming Assignment 3/DynamicProgramming.ipynb -------------------------------------------------------------------------------- /Programming Assignment 3/HuffmanCoding.html: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SSQ/Coursera-Stanford-Greedy-Algorithms-Minimum-Spanning-Trees-and-Dynamic-Programming/HEAD/Programming Assignment 3/HuffmanCoding.html -------------------------------------------------------------------------------- /Programming Assignment 3/HuffmanCoding.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SSQ/Coursera-Stanford-Greedy-Algorithms-Minimum-Spanning-Trees-and-Dynamic-Programming/HEAD/Programming Assignment 3/HuffmanCoding.ipynb -------------------------------------------------------------------------------- /Programming Assignment 3/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SSQ/Coursera-Stanford-Greedy-Algorithms-Minimum-Spanning-Trees-and-Dynamic-Programming/HEAD/Programming Assignment 3/README.md -------------------------------------------------------------------------------- /Programming Assignment 3/huffman.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SSQ/Coursera-Stanford-Greedy-Algorithms-Minimum-Spanning-Trees-and-Dynamic-Programming/HEAD/Programming Assignment 3/huffman.txt -------------------------------------------------------------------------------- /Programming Assignment 3/mwis.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SSQ/Coursera-Stanford-Greedy-Algorithms-Minimum-Spanning-Trees-and-Dynamic-Programming/HEAD/Programming Assignment 3/mwis.txt -------------------------------------------------------------------------------- /Programming Assignment 4/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SSQ/Coursera-Stanford-Greedy-Algorithms-Minimum-Spanning-Trees-and-Dynamic-Programming/HEAD/Programming Assignment 4/README.md -------------------------------------------------------------------------------- /Programming Assignment 4/knapsack1.html: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SSQ/Coursera-Stanford-Greedy-Algorithms-Minimum-Spanning-Trees-and-Dynamic-Programming/HEAD/Programming Assignment 4/knapsack1.html -------------------------------------------------------------------------------- /Programming Assignment 4/knapsack1.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SSQ/Coursera-Stanford-Greedy-Algorithms-Minimum-Spanning-Trees-and-Dynamic-Programming/HEAD/Programming Assignment 4/knapsack1.ipynb -------------------------------------------------------------------------------- /Programming Assignment 4/knapsack1.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SSQ/Coursera-Stanford-Greedy-Algorithms-Minimum-Spanning-Trees-and-Dynamic-Programming/HEAD/Programming Assignment 4/knapsack1.txt -------------------------------------------------------------------------------- /Programming Assignment 4/knapsack_big.html: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SSQ/Coursera-Stanford-Greedy-Algorithms-Minimum-Spanning-Trees-and-Dynamic-Programming/HEAD/Programming Assignment 4/knapsack_big.html -------------------------------------------------------------------------------- /Programming Assignment 4/knapsack_big.ipynb: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SSQ/Coursera-Stanford-Greedy-Algorithms-Minimum-Spanning-Trees-and-Dynamic-Programming/HEAD/Programming Assignment 4/knapsack_big.ipynb -------------------------------------------------------------------------------- /Programming Assignment 4/knapsack_big.txt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SSQ/Coursera-Stanford-Greedy-Algorithms-Minimum-Spanning-Trees-and-Dynamic-Programming/HEAD/Programming Assignment 4/knapsack_big.txt -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SSQ/Coursera-Stanford-Greedy-Algorithms-Minimum-Spanning-Trees-and-Dynamic-Programming/HEAD/README.md --------------------------------------------------------------------------------