Stanford Lecture Algorithms | 99C46B276226EE8A411CFAF1744C5FAA5502D5CF

Stanford Lecture Algorithms

Name	Stanford Lecture Algorithms	DOWNLOAD Copy Link Trouble downloading? see How To
Total Size	3.9 GB
Total Files	1116
Hash	99C46B276226EE8A411CFAF1744C5FAA5502D5CF

/Part 2/Assignments/9_Programming_Assignment_5/
tsp.txt	0.6 KB
links.txt	1.5 KB
zip_page.html	53.9 KB
9_Programming_Assignment_5.html	53.9 KB
/Part 2/Assignments/5_Programming_Assignment_3/
knapsack1.txt	1.0 KB
links.txt	1.5 KB
knapsack_big.txt	25.6 KB
5_Programming_Assignment_3.html	42.4 KB
zip_page.html	42.4 KB
/Part 2/DiscussionForums/
links.txt	1.3 KB
DiscussionForums.html	60.6 KB
/.../20_XX._THE_WIDER_WORLD_OF_ALGORITHMS_Week_6/
04_Epilogue_1_min.txt	1.3 KB
04_Epilogue_1_min.srt	1.9 KB
03_Linear_Programming_and_Beyond_Optional_11_min.txt	11.7 KB
01_Stable_Matching_Optional_15_min.txt	13.6 KB
02_Matchings_Flows_and_Braesss_Paradox_Optional_14_min.txt	13.7 KB
03_Linear_Programming_and_Beyond_Optional_11_min.srt	17.5 KB
02_Matchings_Flows_and_Braesss_Paradox_Optional_14_min.srt	20.3 KB
01_Stable_Matching_Optional_15_min.srt	20.4 KB
02_Matchings_Flows_and_Braesss_Paradox_Optional_14_min.pdf	164.5 KB
01_Stable_Matching_Optional_15_min.pdf	164.5 KB
03_Linear_Programming_and_Beyond_Optional_11_min.pdf	164.5 KB
04_Epilogue_1_min.mp4	1.9 MB
01_Stable_Matching_Optional_15_min_0_Slides_PDF.pdf	5.4 MB
03_Linear_Programming_and_Beyond_Optional_11_min_0_Slides_PDF.pdf	5.4 MB
02_Matchings_Flows_and_Braesss_Paradox_Optional_14_min_0_Slides_PDF.pdf	5.4 MB
03_Linear_Programming_and_Beyond_Optional_11_min.mp4	17.7 MB
02_Matchings_Flows_and_Braesss_Paradox_Optional_14_min.mp4	22.0 MB
01_Stable_Matching_Optional_15_min.mp4	23.6 MB
/Part 2/Syllabus/
links.txt	1.4 KB
Syllabus.html	39.4 KB
/Part 2/CourseLogisticsAssessment/
links.txt	1.4 KB
CourseLogisticsAssessment.html	36.2 KB
/Part 2/Tips/
links.txt	1.4 KB
Tips.html	36.8 KB
/.../10_Problem_Set_6/
links.txt	1.4 KB
10_Problem_Set_6.html	103.9 KB
/Part 2/Assignments/2_Problem_Set_2/
links.txt	1.4 KB
2_Problem_Set_2.html	95.5 KB
/Part 2/Assignments/4_Problem_Set_3/
links.txt	1.4 KB
4_Problem_Set_3.html	115.2 KB
/Part 2/Assignments/6_Problem_Set_4/
links.txt	1.4 KB
6_Problem_Set_4.html	106.1 KB
/Part 2/Assignments/0_Problem_Set_1/
links.txt	1.4 KB
0_Problem_Set_1.html	147.2 KB
/Part 2/Assignments/8_Problem_Set_5/
links.txt	1.4 KB
8_Problem_Set_5.html	79.9 KB
/Part 2/FinalExam/0_Final_Exam/
links.txt	1.4 KB
0_Final_Exam.html	32.5 KB
/Part 2/TheoryOptionalProblems/
links.txt	1.5 KB
TheoryOptionalProblems.html	89.4 KB
/Part 2/Assignments/1_Programming_Assignment_1/
links.txt	1.5 KB
edges.txt	28.3 KB
zip_page.html	43.9 KB
1_Programming_Assignment_1.html	43.9 KB
jobs.txt	58.4 KB
/Part 2/Assignments/3_Programming_Assignment_2/
links.txt	1.5 KB
zip_page.html	56.1 KB
3_Programming_Assignment_2.html	56.1 KB
clustering1.txt	1.6 MB
clustering_big.txt	9.8 MB
/Part 1/Syllabus/
links.txt	1.6 KB
Syllabus.html	38.9 KB
/Part 1/TheoryProblems/
links.txt	1.6 KB
TheoryProblems.html	97.7 KB
/Part 1/CourseLogistics/
links.txt	1.6 KB
CourseLogistics.html	36.2 KB
/Part 1/ProblemSets/5_Problem_Set6/
links.txt	1.6 KB
5_Problem_Set6.html	77.2 KB
/Part 1/ProblemSets/3_Problem_Set4/
links.txt	1.6 KB
3_Problem_Set4.html	102.0 KB
/Part 1/ProblemSets/2_Problem_Set3/
links.txt	1.6 KB
2_Problem_Set3.html	55.0 KB
/Part 1/ProblemSets/1_Problem_Set2/
links.txt	1.6 KB
1_Problem_Set2.html	54.0 KB
/Part 1/ProblemSets/0_Problem_Set1/
links.txt	1.6 KB
0_Problem_Set1.html	108.5 KB
/Part 1/ProblemSets/4_Problem_Set5/
links.txt	1.6 KB
4_Problem_Set5.html	88.5 KB
/Part 2/Assignments/7_Programming_Assignment_4/
links.txt	1.6 KB
7_Programming_Assignment_4.html	51.8 KB
zip_page.html	51.8 KB
g3.txt	509.5 KB
g1.txt	509.5 KB
g2.txt	509.7 KB
large.txt	13.8 MB
/Part 1/FinalExam/0_Final_Exam/
links.txt	1.6 KB
0_Final_Exam.html	32.3 KB
/Part 1/ProgrammingQuestions/1_Programming_Question__2/
links.txt	1.7 KB
zip_page.html	58.8 KB
1_Programming_Question__2.html	58.8 KB
QuickSort.txt	58.9 KB
/Part 1/ProgrammingQuestions/4_Programming_Question5/
links.txt	1.7 KB
dijkstraData.txt	32.2 KB
4_Programming_Question5.html	46.0 KB
zip_page.html	46.1 KB
/Part 1/ProgrammingQuestions/2_Programming_Question__3/
links.txt	1.7 KB
kargerMinCut.txt	18.6 KB
2_Programming_Question__3.html	46.1 KB
zip_page.html	46.1 KB
/Part 1/ProgrammingQuestions/0_Programming_Question1/
links.txt	1.7 KB
zip_page.html	48.7 KB
0_Programming_Question1.html	48.7 KB
IntegerArray.txt	688.9 KB
/Part 1/ProgrammingQuestions/3_Programming_Question4/
links.txt	1.7 KB
zip_page.html	47.6 KB
3_Programming_Question4.html	47.6 KB
SCC.zip	11.6 MB
SCC.txt	72.7 MB
/Part 1/ProgrammingQuestions/5_Programming_Question__6/
links.txt	1.7 KB
Median.txt	58.9 KB
zip_page.html	77.5 KB
5_Programming_Question__6.html	77.5 KB
algo1%2Fprogramming_prob%2F2sum.txt	12.4 MB
/.../11_Programming_Assignment_6/
links.txt	1.8 KB
zip_page.html	49.1 KB
11_Programming_Assignment_6.html	49.1 KB
2sat1.txt	1.3 MB
2sat2.txt	2.8 MB
2sat3.txt	5.8 MB
2sat4.txt	8.8 MB
2sat5.txt	11.8 MB
2sat6.txt	14.8 MB
/Part 1/Home/
links.txt	1.9 KB
Home.html	81.7 KB
/Part 2/Home/
links.txt	2.4 KB
Home.html	63.5 KB
/Part 1/DiscussionForums/
links.txt	2.8 KB
DiscussionForums.html	60.9 KB
/.../09_IX._HUFFMAN_CODES_Week_2/
04_A_More_Complex_Example_4_min.txt	3.5 KB
04_A_More_Complex_Example_4_min.srt	5.1 KB
01_Introduction_and_Motivation_9_min.txt	9.8 KB
02_Problem_Definition_10_min.txt	10.6 KB
05_Correctness_Proof_I_10_min.txt	10.8 KB
06_Correctness_Proof_II_13_min.txt	14.2 KB
01_Introduction_and_Motivation_9_min.srt	14.7 KB
02_Problem_Definition_10_min.srt	15.9 KB
05_Correctness_Proof_I_10_min.srt	16.1 KB
03_A_Greedy_Algorithm_17_min.txt	18.0 KB
06_Correctness_Proof_II_13_min.srt	21.4 KB
03_A_Greedy_Algorithm_17_min.srt	27.0 KB
04_A_More_Complex_Example_4_min.pdf	88.0 KB
01_Introduction_and_Motivation_9_min.pdf	101.5 KB
02_Problem_Definition_10_min.pdf	167.7 KB
06_Correctness_Proof_II_13_min.pdf	177.5 KB
05_Correctness_Proof_I_10_min.pdf	177.5 KB
03_A_Greedy_Algorithm_17_min.pdf	188.0 KB
04_A_More_Complex_Example_4_min_0_Slides_PDF.pdf	827.2 KB
01_Introduction_and_Motivation_9_min_0_Slides_PDF.pdf	1.7 MB
02_Problem_Definition_10_min_0_Slides_PDF.pdf	2.0 MB
03_A_Greedy_Algorithm_17_min_0_Slides_PDF.pdf	2.8 MB
06_Correctness_Proof_II_13_min_0_Slides_PDF.pdf	3.7 MB
05_Correctness_Proof_I_10_min_0_Slides_PDF.pdf	3.7 MB
04_A_More_Complex_Example_4_min.mp4	5.8 MB
01_Introduction_and_Motivation_9_min.mp4	12.5 MB
05_Correctness_Proof_I_10_min.mp4	14.0 MB
02_Problem_Definition_10_min.mp4	16.1 MB
06_Correctness_Proof_II_13_min.mp4	17.6 MB
03_A_Greedy_Algorithm_17_min.mp4	25.9 MB
/.../01_I._INTRODUCTION_Week_1/
01_Why_Study_Algorithms__4_min.txt	3.9 KB
01_Why_Study_Algorithms__4_min.srt	5.8 KB
02_Integer_Multiplication_9_min.txt	7.6 KB
07_Merge_Sort-_Analysis_9_min.txt	9.7 KB
05_Merge_Sort-_Motivation_and_Example_9_min.txt	10.4 KB
02_Integer_Multiplication_9_min.srt	11.3 KB
03_Karatsuba_Multiplication_13_min.txt	11.6 KB
05_Merge_Sort-_Motivation_and_Example_9_min.srt	13.5 KB
07_Merge_Sort-_Analysis_9_min.srt	14.2 KB
06_Merge_Sort-_Pseudocode_13_min.txt	14.2 KB
08_Guiding_Principles_for_Analysis_of_Algorithms_15_min.txt	17.1 KB
03_Karatsuba_Multiplication_13_min.srt	17.5 KB
06_Merge_Sort-_Pseudocode_13_min.srt	20.7 KB
04_About_the_Course_17_min.txt	21.1 KB
08_Guiding_Principles_for_Analysis_of_Algorithms_15_min.srt	25.1 KB
04_About_the_Course_17_min.srt	30.9 KB
01_Why_Study_Algorithms__4_min_0_PDF.pdf	221.0 KB
01_Why_Study_Algorithms__4_min.pdf	221.0 KB
04_About_the_Course_17_min_0_PDF.pdf	265.8 KB
01_Why_Study_Algorithms__4_min.pptx	288.5 KB
04_About_the_Course_17_min.pptx	457.6 KB
08_Guiding_Principles_for_Analysis_of_Algorithms_15_min.pdf	567.3 KB
02_Integer_Multiplication_9_min.pdf	625.6 KB
05_Merge_Sort-_Motivation_and_Example_9_min_0_PDF.pdf	647.8 KB
06_Merge_Sort-_Pseudocode_13_min.pdf	679.8 KB
03_Karatsuba_Multiplication_13_min.pdf	693.4 KB
05_Merge_Sort-_Motivation_and_Example_9_min.pdf	713.9 KB
07_Merge_Sort-_Analysis_9_min.pdf	737.8 KB
04_About_the_Course_17_min.pdf	749.0 KB
02_Integer_Multiplication_9_min_0_PDF.pdf	809.9 KB
05_Merge_Sort-_Motivation_and_Example_9_min.pptx	815.1 KB
07_Merge_Sort-_Analysis_9_min_0_PDF.pdf	953.3 KB
06_Merge_Sort-_Pseudocode_13_min_0_PDF.pdf	1.1 MB
07_Merge_Sort-_Analysis_9_min.pptx	1.1 MB
03_Karatsuba_Multiplication_13_min_0_PDF.pdf	1.3 MB
06_Merge_Sort-_Pseudocode_13_min.pptx	1.3 MB
08_Guiding_Principles_for_Analysis_of_Algorithms_15_min_0_PDF.pdf	1.5 MB
08_Guiding_Principles_for_Analysis_of_Algorithms_15_min.pptx	1.7 MB
01_Why_Study_Algorithms__4_min.mp4	8.4 MB
05_Merge_Sort-_Motivation_and_Example_9_min.mp4	11.2 MB
07_Merge_Sort-_Analysis_9_min.mp4	11.9 MB
06_Merge_Sort-_Pseudocode_13_min.mp4	15.7 MB
02_Integer_Multiplication_9_min.mp4	17.7 MB
04_About_the_Course_17_min.mp4	18.2 MB
08_Guiding_Principles_for_Analysis_of_Algorithms_15_min.mp4	18.9 MB
03_Karatsuba_Multiplication_13_min.mp4	22.7 MB
/.../02_II._ASYMPTOTIC_ANALYSIS_Week_1/
02_Big-Oh_Notation_4_min.txt	4.4 KB
02_Big-Oh_Notation_4_min.srt	6.5 KB
03_Basic_Examples_7_min.txt	7.8 KB
04_Big_Omega_and_Theta_7_min.txt	8.2 KB
05_Additional_Examples_Review_-_Optional_8_min.txt	8.4 KB
03_Basic_Examples_7_min.srt	11.3 KB
04_Big_Omega_and_Theta_7_min.srt	12.0 KB
05_Additional_Examples_Review_-_Optional_8_min.srt	12.3 KB
01_The_Gist_14_min.txt	14.4 KB
01_The_Gist_14_min.srt	21.7 KB
01_The_Gist_14_min.pdf	280.0 KB
03_Basic_Examples_7_min.pdf	345.7 KB
03_Basic_Examples_7_min_0_PDF.pdf	675.2 KB
02_Big-Oh_Notation_4_min_0_PDF.pdf	676.2 KB
02_Big-Oh_Notation_4_min.pdf	831.5 KB
05_Additional_Examples_Review_-_Optional_8_min.pdf	842.1 KB
03_Basic_Examples_7_min.pptx	881.1 KB
04_Big_Omega_and_Theta_7_min_0_PDF.pdf	889.5 KB
02_Big-Oh_Notation_4_min.pptx	889.9 KB
04_Big_Omega_and_Theta_7_min.pdf	1.0 MB
05_Additional_Examples_Review_-_Optional_8_min_0_PDF.pdf	1.1 MB
04_Big_Omega_and_Theta_7_min.pptx	1.1 MB
05_Additional_Examples_Review_-_Optional_8_min.pptx	1.3 MB
01_The_Gist_14_min_0_PDF.pdf	2.3 MB
02_Big-Oh_Notation_4_min.mp4	4.3 MB
03_Basic_Examples_7_min.mp4	7.7 MB
04_Big_Omega_and_Theta_7_min.mp4	7.9 MB
05_Additional_Examples_Review_-_Optional_8_min.mp4	8.1 MB
01_The_Gist_14_min.mp4	29.0 MB
/.../02_II._SELECTED_REVIEW_FROM_PART_I_Week_1/
04_Big-Oh_Notation_Part_I_Review_-_Optional_4_min.txt	4.6 KB
08_Data_Structures-_Overview_Part_I_Review_-_Optional_5_min.txt	5.2 KB
04_Big-Oh_Notation_Part_I_Review_-_Optional_4_min.srt	6.9 KB
08_Data_Structures-_Overview_Part_I_Review_-_Optional_5_min.srt	7.7 KB
05_Graph_Representations_Part_I_Review_-_Optional_14_min.txt	16.0 KB
03_Guiding_Principles_for_Analysis_of_Algorithms_Part_I_Review_-_Optional_15_min.txt	17.4 KB
02_Why_Study_Algorithms_Part_I_Review_-_Optional_19_min.txt	20.0 KB
09_Heaps-_Operations_and_Applications_Part_I_Review_-_Optional_18_min.txt	20.4 KB
01_About_the_Course_Part_I_Review_-_Optional_17_min.txt	21.4 KB
07_Dijkstras_Shortest-Path_Algorithm_Part_I_Review_-_Optional_21_min.txt	22.9 KB
05_Graph_Representations_Part_I_Review_-_Optional_14_min.srt	24.3 KB
03_Guiding_Principles_for_Analysis_of_Algorithms_Part_I_Review_-_Optional_15_min.srt	25.9 KB
06_Graph_Search_-_Overview_Part_I_Review_-_Optional_23_min.txt	27.3 KB
02_Why_Study_Algorithms_Part_I_Review_-_Optional_19_min.srt	29.9 KB
09_Heaps-_Operations_and_Applications_Part_I_Review_-_Optional_18_min.srt	30.7 KB
01_About_the_Course_Part_I_Review_-_Optional_17_min.srt	32.1 KB
07_Dijkstras_Shortest-Path_Algorithm_Part_I_Review_-_Optional_21_min.srt	34.5 KB
06_Graph_Search_-_Overview_Part_I_Review_-_Optional_23_min.srt	41.1 KB
08_Data_Structures-_Overview_Part_I_Review_-_Optional_5_min.pdf	197.5 KB
01_About_the_Course_Part_I_Review_-_Optional_17_min_0_Slides_PDF.pdf	214.1 KB
09_Heaps-_Operations_and_Applications_Part_I_Review_-_Optional_18_min.pdf	226.2 KB
07_Dijkstras_Shortest-Path_Algorithm_Part_I_Review_-_Optional_21_min.pdf	443.1 KB
05_Graph_Representations_Part_I_Review_-_Optional_14_min.pdf	472.4 KB
03_Guiding_Principles_for_Analysis_of_Algorithms_Part_I_Review_-_Optional_15_min.pdf	567.3 KB
04_Big-Oh_Notation_Part_I_Review_-_Optional_4_min_0_Slides_PDF.pdf	676.2 KB
02_Why_Study_Algorithms_Part_I_Review_-_Optional_19_min.pdf	746.6 KB
01_About_the_Course_Part_I_Review_-_Optional_17_min.pdf	749.0 KB
04_Big-Oh_Notation_Part_I_Review_-_Optional_4_min.pdf	831.5 KB
08_Data_Structures-_Overview_Part_I_Review_-_Optional_5_min_0_Slides_PDF.pdf	864.7 KB
02_Why_Study_Algorithms_Part_I_Review_-_Optional_19_min_0_Slides_PDF.pdf	1.3 MB
03_Guiding_Principles_for_Analysis_of_Algorithms_Part_I_Review_-_Optional_15_min_0_Slides_PDF.pdf	1.5 MB
05_Graph_Representations_Part_I_Review_-_Optional_14_min_0_Slides_PDF.pdf	1.9 MB
06_Graph_Search_-_Overview_Part_I_Review_-_Optional_23_min.pdf	2.1 MB
09_Heaps-_Operations_and_Applications_Part_I_Review_-_Optional_18_min_0_Slides_PDF.pdf	2.2 MB
06_Graph_Search_-_Overview_Part_I_Review_-_Optional_23_min_0_Slides_PDF.pdf	2.4 MB
07_Dijkstras_Shortest-Path_Algorithm_Part_I_Review_-_Optional_21_min_0_Slides_PDF.pdf	2.8 MB
04_Big-Oh_Notation_Part_I_Review_-_Optional_4_min.mp4	4.6 MB
08_Data_Structures-_Overview_Part_I_Review_-_Optional_5_min.mp4	5.1 MB
05_Graph_Representations_Part_I_Review_-_Optional_14_min.mp4	15.2 MB
01_About_the_Course_Part_I_Review_-_Optional_17_min.mp4	19.2 MB
03_Guiding_Principles_for_Analysis_of_Algorithms_Part_I_Review_-_Optional_15_min.mp4	19.8 MB
09_Heaps-_Operations_and_Applications_Part_I_Review_-_Optional_18_min.mp4	20.4 MB
02_Why_Study_Algorithms_Part_I_Review_-_Optional_19_min.mp4	21.2 MB
07_Dijkstras_Shortest-Path_Algorithm_Part_I_Review_-_Optional_21_min.mp4	23.0 MB
06_Graph_Search_-_Overview_Part_I_Review_-_Optional_23_min.mp4	25.5 MB
/.../04_IV._A_SCHEDULING_APPLICATION_Week_1/
04_Correctness_Proof_-_Part_II_5_min.txt	4.8 KB
01_Problem_Definition_6_min.txt	6.9 KB
04_Correctness_Proof_-_Part_II_5_min.srt	7.1 KB
03_Correctness_Proof_-_Part_I_7_min.txt	8.0 KB
05_Handling_Ties_Advanced_-_Optional_7_min.txt	8.1 KB
01_Problem_Definition_6_min.srt	10.3 KB
03_Correctness_Proof_-_Part_I_7_min.srt	11.9 KB
05_Handling_Ties_Advanced_-_Optional_7_min.srt	12.0 KB
02_A_Greedy_Algorithm_13_min.txt	15.0 KB
02_A_Greedy_Algorithm_13_min.srt	22.5 KB
04_Correctness_Proof_-_Part_II_5_min.pdf	114.4 KB
03_Correctness_Proof_-_Part_I_7_min.pdf	114.8 KB
01_Problem_Definition_6_min.pdf	114.9 KB
02_A_Greedy_Algorithm_13_min.pdf	116.2 KB
05_Handling_Ties_Advanced_-_Optional_7_min.pdf	123.7 KB
01_Problem_Definition_6_min_0_Slides_PDF.pdf	966.8 KB
04_Correctness_Proof_-_Part_II_5_min_0_Slides_PDF.pdf	973.1 KB
03_Correctness_Proof_-_Part_I_7_min_0_Slides_PDF.pdf	1.4 MB
05_Handling_Ties_Advanced_-_Optional_7_min_0_Slides_PDF.pdf	1.4 MB
02_A_Greedy_Algorithm_13_min_0_Slides_PDF.pdf	1.7 MB
04_Correctness_Proof_-_Part_II_5_min.mp4	6.5 MB
01_Problem_Definition_6_min.mp4	8.2 MB
03_Correctness_Proof_-_Part_I_7_min.mp4	9.7 MB
05_Handling_Ties_Advanced_-_Optional_7_min.mp4	10.1 MB
02_A_Greedy_Algorithm_13_min.mp4	18.0 MB
/.../12_XII._HEAPS_Week_5/
01_Data_Structures-_Overview_5_min.txt	5.1 KB
01_Data_Structures-_Overview_5_min.srt	7.4 KB
02_Heaps-_Operations_and_Applications_18_min.txt	20.1 KB
03_Heaps-_Implementation_Details_Advanced_-_Optional_21_min.txt	22.9 KB
02_Heaps-_Operations_and_Applications_18_min.srt	29.3 KB
03_Heaps-_Implementation_Details_Advanced_-_Optional_21_min.srt	33.5 KB
01_Data_Structures-_Overview_5_min.pdf	197.5 KB
02_Heaps-_Operations_and_Applications_18_min.pdf	226.2 KB
01_Data_Structures-_Overview_5_min_0_PDF.pdf	864.7 KB
03_Heaps-_Implementation_Details_Advanced_-_Optional_21_min.pdf	1.1 MB
01_Data_Structures-_Overview_5_min.pptx	1.1 MB
03_Heaps-_Implementation_Details_Advanced_-_Optional_21_min_0_PDF.pdf	2.2 MB
02_Heaps-_Operations_and_Applications_18_min_0_PDF.pdf	2.2 MB
03_Heaps-_Implementation_Details_Advanced_-_Optional_21_min.pptx	2.5 MB
02_Heaps-_Operations_and_Applications_18_min.pptx	2.5 MB
01_Data_Structures-_Overview_5_min.mp4	4.9 MB
02_Heaps-_Operations_and_Applications_18_min.mp4	19.5 MB
03_Heaps-_Implementation_Details_Advanced_-_Optional_21_min.mp4	21.9 MB
/.../09_IX._GRAPHS_AND_THE_CONTRACTION_ALGORITHM_Week_3/
05_Counting_Minimum_Cuts_7_min.txt	6.7 KB
03_Random_Contraction_Algorithm_9_min.txt	9.5 KB
05_Counting_Minimum_Cuts_7_min.srt	9.8 KB
03_Random_Contraction_Algorithm_9_min.srt	13.9 KB
02_Graph_Representations_14_min.txt	15.6 KB
01_Graphs_and_Minimum_Cuts_16_min.txt	16.7 KB
02_Graph_Representations_14_min.srt	22.3 KB
01_Graphs_and_Minimum_Cuts_16_min.srt	24.4 KB
04_Analysis_of_Contraction_Algorithm_30_min.txt	29.6 KB
04_Analysis_of_Contraction_Algorithm_30_min.srt	43.6 KB
05_Counting_Minimum_Cuts_7_min.pdf	286.2 KB
02_Graph_Representations_14_min.pdf	472.4 KB
01_Graphs_and_Minimum_Cuts_16_min.pdf	508.6 KB
04_Analysis_of_Contraction_Algorithm_30_min.pdf	628.0 KB
03_Random_Contraction_Algorithm_9_min.pdf	641.9 KB
05_Counting_Minimum_Cuts_7_min_0_PDF.pdf	1.1 MB
03_Random_Contraction_Algorithm_9_min_0_PDF.pdf	1.2 MB
05_Counting_Minimum_Cuts_7_min.pptx	1.3 MB
03_Random_Contraction_Algorithm_9_min.pptx	1.5 MB
01_Graphs_and_Minimum_Cuts_16_min_0_PDF.pdf	1.8 MB
02_Graph_Representations_14_min_0_PDF.pdf	1.9 MB
02_Graph_Representations_14_min.pptx	1.9 MB
01_Graphs_and_Minimum_Cuts_16_min.pptx	2.1 MB
04_Analysis_of_Contraction_Algorithm_30_min_0_PDF.pdf	3.8 MB
04_Analysis_of_Contraction_Algorithm_30_min.pptx	4.2 MB
05_Counting_Minimum_Cuts_7_min.mp4	7.8 MB
03_Random_Contraction_Algorithm_9_min.mp4	8.7 MB
01_Graphs_and_Minimum_Cuts_16_min.mp4	15.9 MB
02_Graph_Representations_14_min.mp4	16.4 MB
04_Analysis_of_Contraction_Algorithm_30_min.mp4	31.3 MB
/.../13_XIII._OPTIMAL_BINARY_SEARCH_TREES_Week_3/
03_Proof_of_Optimal_Substructure_7_min.txt	6.7 KB
03_Proof_of_Optimal_Substructure_7_min.srt	9.9 KB
05_A_Dynamic_Programming_Algorithm_II_9_min.txt	10.7 KB
02_Optimal_Substructure_9_min.txt	10.7 KB
04_A_Dynamic_Programming_Algorithm_I_10_min.txt	11.1 KB
01_Problem_Definition_12_min.txt	13.9 KB
05_A_Dynamic_Programming_Algorithm_II_9_min.srt	15.8 KB
02_Optimal_Substructure_9_min.srt	15.9 KB
04_A_Dynamic_Programming_Algorithm_I_10_min.srt	16.6 KB
01_Problem_Definition_12_min.srt	20.7 KB
01_Problem_Definition_12_min.pdf	165.2 KB
02_Optimal_Substructure_9_min.pdf	176.6 KB
03_Proof_of_Optimal_Substructure_7_min.pdf	176.6 KB
04_A_Dynamic_Programming_Algorithm_I_10_min.pdf	232.5 KB
05_A_Dynamic_Programming_Algorithm_II_9_min.pdf	232.5 KB
01_Problem_Definition_12_min_0_Slides_PDF.pdf	2.0 MB
05_A_Dynamic_Programming_Algorithm_II_9_min_0_Slides_PDF.pdf	3.0 MB
04_A_Dynamic_Programming_Algorithm_I_10_min_0_Slides_PDF.pdf	3.0 MB
03_Proof_of_Optimal_Substructure_7_min_0_Slides_PDF.pdf	3.4 MB
02_Optimal_Substructure_9_min_0_Slides_PDF.pdf	3.4 MB
03_Proof_of_Optimal_Substructure_7_min.mp4	10.3 MB
05_A_Dynamic_Programming_Algorithm_II_9_min.mp4	12.5 MB
02_Optimal_Substructure_9_min.mp4	14.6 MB
04_A_Dynamic_Programming_Algorithm_I_10_min.mp4	14.7 MB
01_Problem_Definition_12_min.mp4	18.0 MB
/.../18_XVIII._APPROXIMATION_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_6/
02_Analysis_of_a_Greedy_Knapsack_Heuristic_I_7_min.txt	7.0 KB
03_Analysis_of_a_Greedy_Knapsack_Heuristic_II_10_min.txt	10.4 KB
02_Analysis_of_a_Greedy_Knapsack_Heuristic_I_7_min.srt	10.4 KB
05_Knapsack_via_Dynamic_Programming_Revisited_10_min.txt	10.6 KB
04_A_Dynamic_Programming_Heuristic_for_Knapsack_12_min.txt	12.1 KB
01_A_Greedy_Knapsack_Heuristic_14_min.txt	14.5 KB
06_Ananysis_of_Dynamic_Programming_Heuristic_15_min.txt	14.7 KB
03_Analysis_of_a_Greedy_Knapsack_Heuristic_II_10_min.srt	15.5 KB
05_Knapsack_via_Dynamic_Programming_Revisited_10_min.srt	15.9 KB
04_A_Dynamic_Programming_Heuristic_for_Knapsack_12_min.srt	18.0 KB
01_A_Greedy_Knapsack_Heuristic_14_min.srt	21.7 KB
06_Ananysis_of_Dynamic_Programming_Heuristic_15_min.srt	21.8 KB
04_A_Dynamic_Programming_Heuristic_for_Knapsack_12_min.pdf	109.2 KB
01_A_Greedy_Knapsack_Heuristic_14_min.pdf	127.5 KB
06_Ananysis_of_Dynamic_Programming_Heuristic_15_min.pdf	141.6 KB
05_Knapsack_via_Dynamic_Programming_Revisited_10_min.pdf	147.9 KB
02_Analysis_of_a_Greedy_Knapsack_Heuristic_I_7_min.pdf	156.0 KB
03_Analysis_of_a_Greedy_Knapsack_Heuristic_II_10_min.pdf	156.0 KB
05_Knapsack_via_Dynamic_Programming_Revisited_10_min_0_Slides_PDF.pdf	1.5 MB
04_A_Dynamic_Programming_Heuristic_for_Knapsack_12_min_0_Slides_PDF.pdf	1.7 MB
06_Ananysis_of_Dynamic_Programming_Heuristic_15_min_0_Slides_PDF.pdf	2.2 MB
01_A_Greedy_Knapsack_Heuristic_14_min_0_Slides_PDF.pdf	2.2 MB
03_Analysis_of_a_Greedy_Knapsack_Heuristic_II_10_min_0_Slides_PDF.pdf	2.8 MB
02_Analysis_of_a_Greedy_Knapsack_Heuristic_I_7_min_0_Slides_PDF.pdf	2.8 MB
02_Analysis_of_a_Greedy_Knapsack_Heuristic_I_7_min.mp4	9.4 MB
03_Analysis_of_a_Greedy_Knapsack_Heuristic_II_10_min.mp4	13.0 MB
05_Knapsack_via_Dynamic_Programming_Revisited_10_min.mp4	13.9 MB
04_A_Dynamic_Programming_Heuristic_for_Knapsack_12_min.mp4	16.2 MB
06_Ananysis_of_Dynamic_Programming_Heuristic_15_min.mp4	19.6 MB
01_A_Greedy_Knapsack_Heuristic_14_min.mp4	19.7 MB
/.../13_XIII._BALANCED_BINARY_SEARCH_TREES_Week_5/
05_Rotations_Advanced_-_Optional_8_min.txt	7.2 KB
05_Rotations_Advanced_-_Optional_8_min.srt	10.7 KB
01_Balanced_Search_Trees-_Operations_and_Applications_11_min.txt	11.9 KB
06_Insertion_in_a_Red-Black_Tree_Advanced_15_min.txt	14.6 KB
02_Binary_Search_Tree_Basics_Part_I_13_min.txt	14.7 KB
01_Balanced_Search_Trees-_Operations_and_Applications_11_min.srt	17.3 KB
02_Binary_Search_Tree_Basics_Part_I_13_min.srt	21.4 KB
06_Insertion_in_a_Red-Black_Tree_Advanced_15_min.srt	21.8 KB
04_Red-Black_Trees_21_min.txt	23.4 KB
03_Binary_Search_Tree_Basics_Part_II_30_min.txt	33.3 KB
04_Red-Black_Trees_21_min.srt	36.1 KB
03_Binary_Search_Tree_Basics_Part_II_30_min.srt	48.7 KB
05_Rotations_Advanced_-_Optional_8_min.pdf	103.2 KB
06_Insertion_in_a_Red-Black_Tree_Advanced_15_min.pdf	111.6 KB
01_Balanced_Search_Trees-_Operations_and_Applications_11_min.pdf	125.5 KB
04_Red-Black_Trees_21_min.pdf	252.6 KB
02_Binary_Search_Tree_Basics_Part_I_13_min.pdf	468.5 KB
03_Binary_Search_Tree_Basics_Part_II_30_min.pdf	468.5 KB
05_Rotations_Advanced_-_Optional_8_min_0_PDF.pdf	889.9 KB
01_Balanced_Search_Trees-_Operations_and_Applications_11_min_0_PDF.pdf	1.0 MB
01_Balanced_Search_Trees-_Operations_and_Applications_11_min.pptx	1.3 MB
06_Insertion_in_a_Red-Black_Tree_Advanced_15_min_0_PDF.pdf	1.6 MB
04_Red-Black_Trees_21_min_0_PDF.pdf	2.4 MB
04_Red-Black_Trees_21_min.pptx	2.7 MB
03_Binary_Search_Tree_Basics_Part_II_30_min_0_PDF.pdf	5.0 MB
02_Binary_Search_Tree_Basics_Part_I_13_min_0_PDF.pdf	5.0 MB
03_Binary_Search_Tree_Basics_Part_II_30_min.pptx	5.4 MB
02_Binary_Search_Tree_Basics_Part_I_13_min.pptx	5.4 MB
05_Rotations_Advanced_-_Optional_8_min.mp4	10.8 MB
01_Balanced_Search_Trees-_Operations_and_Applications_11_min.mp4	11.5 MB
02_Binary_Search_Tree_Basics_Part_I_13_min.mp4	13.9 MB
06_Insertion_in_a_Red-Black_Tree_Advanced_15_min.mp4	21.8 MB
04_Red-Black_Trees_21_min.mp4	22.9 MB
03_Binary_Search_Tree_Basics_Part_II_30_min.mp4	31.4 MB
/.../10_X._INTRODUCTION_TO_DYNAMIC_PROGRAMMING_Week_3/
04_WIS_in_Path_Graphs-_A_Reconstruction_Algorithm_7_min.txt	7.6 KB
05_Principles_of_Dynamic_Programming_8_min.txt	8.5 KB
01_Introduction-_Weighted_Independent_Sets_in_Path_Graphs_8_min.txt	8.9 KB
02_WIS_in_Path_Graphs-_Optimal_Substructure_9_min.txt	9.3 KB
03_WIS_in_Path_Graphs-_A_Linear-Time_Algorithm_10_min.txt	10.6 KB
04_WIS_in_Path_Graphs-_A_Reconstruction_Algorithm_7_min.srt	11.3 KB
05_Principles_of_Dynamic_Programming_8_min.srt	12.7 KB
01_Introduction-_Weighted_Independent_Sets_in_Path_Graphs_8_min.srt	13.4 KB
02_WIS_in_Path_Graphs-_Optimal_Substructure_9_min.srt	13.9 KB
03_WIS_in_Path_Graphs-_A_Linear-Time_Algorithm_10_min.srt	15.9 KB
01_Introduction-_Weighted_Independent_Sets_in_Path_Graphs_8_min.pdf	104.5 KB
05_Principles_of_Dynamic_Programming_8_min.pdf	109.7 KB
03_WIS_in_Path_Graphs-_A_Linear-Time_Algorithm_10_min.pdf	125.3 KB
04_WIS_in_Path_Graphs-_A_Reconstruction_Algorithm_7_min.pdf	130.9 KB
02_WIS_in_Path_Graphs-_Optimal_Substructure_9_min.pdf	133.6 KB
05_Principles_of_Dynamic_Programming_8_min_0_Slides_PDF.pdf	882.8 KB
04_WIS_in_Path_Graphs-_A_Reconstruction_Algorithm_7_min_0_Slides_PDF.pdf	1.2 MB
01_Introduction-_Weighted_Independent_Sets_in_Path_Graphs_8_min_0_Slides_PDF.pdf	1.2 MB
03_WIS_in_Path_Graphs-_A_Linear-Time_Algorithm_10_min_0_Slides_PDF.pdf	1.7 MB
02_WIS_in_Path_Graphs-_Optimal_Substructure_9_min_0_Slides_PDF.pdf	1.8 MB
04_WIS_in_Path_Graphs-_A_Reconstruction_Algorithm_7_min.mp4	10.1 MB
01_Introduction-_Weighted_Independent_Sets_in_Path_Graphs_8_min.mp4	11.8 MB
05_Principles_of_Dynamic_Programming_8_min.mp4	12.9 MB
02_WIS_in_Path_Graphs-_Optimal_Substructure_9_min.mp4	14.2 MB
03_WIS_in_Path_Graphs-_A_Linear-Time_Algorithm_10_min.mp4	15.2 MB
/.../15_XV._ALL-PAIRS_SHORTEST_PATHS_Week_4/
01_Problem_Definition_7_min.txt	7.6 KB
05_Johnsons_Algorithm_I_11_min.txt	10.8 KB
01_Problem_Definition_7_min.srt	11.4 KB
06_Johnsons_Algorithm_II_11_min.txt	11.5 KB
02_Optimal_Substructure_12_min.txt	13.4 KB
04_A_Reweighting_Technique_14_min.txt	14.0 KB
03_The_Floyd-Warshall_Algorithm_13_min.txt	14.9 KB
05_Johnsons_Algorithm_I_11_min.srt	16.0 KB
06_Johnsons_Algorithm_II_11_min.srt	17.3 KB
02_Optimal_Substructure_12_min.srt	20.2 KB
04_A_Reweighting_Technique_14_min.srt	21.1 KB
03_The_Floyd-Warshall_Algorithm_13_min.srt	22.2 KB
01_Problem_Definition_7_min.pdf	114.3 KB
03_The_Floyd-Warshall_Algorithm_13_min.pdf	131.1 KB
02_Optimal_Substructure_12_min.pdf	140.0 KB
05_Johnsons_Algorithm_I_11_min.pdf	171.3 KB
06_Johnsons_Algorithm_II_11_min.pdf	171.3 KB
04_A_Reweighting_Technique_14_min.pdf	187.7 KB
01_Problem_Definition_7_min_0_Slides_PDF.pdf	1.1 MB
02_Optimal_Substructure_12_min_0_Slides_PDF.pdf	2.0 MB
03_The_Floyd-Warshall_Algorithm_13_min_0_Slides_PDF.pdf	2.0 MB
04_A_Reweighting_Technique_14_min_0_Slides_PDF.pdf	2.5 MB
05_Johnsons_Algorithm_I_11_min_0_Slides_PDF.pdf	3.2 MB
06_Johnsons_Algorithm_II_11_min_0_Slides_PDF.pdf	3.2 MB
01_Problem_Definition_7_min.mp4	9.9 MB
05_Johnsons_Algorithm_I_11_min.mp4	16.2 MB
02_Optimal_Substructure_12_min.mp4	17.3 MB
06_Johnsons_Algorithm_II_11_min.mp4	17.7 MB
03_The_Floyd-Warshall_Algorithm_13_min.mp4	19.8 MB
04_A_Reweighting_Technique_14_min.mp4	20.6 MB
/.../14_XIV._THE_BELLMAN-FORD_ALGORITHM_Week_4/
08_Internet_Routing_II_Optional_7_min.txt	7.6 KB
03_The_Basic_Algorithm_I_9_min.txt	8.7 KB
05_Detecting_Negative_Cycles_9_min.txt	9.8 KB
04_The_Basic_Algorithm_II_11_min.txt	10.9 KB
02_Optimal_Substructure_11_min.txt	11.3 KB
08_Internet_Routing_II_Optional_7_min.srt	11.4 KB
01_Single-Source_Shortest_Paths_Revisted_11_min.txt	12.1 KB
06_A_Space_Optimization_12_min.txt	12.8 KB
03_The_Basic_Algorithm_I_9_min.srt	12.8 KB
07_Internet_Routing_I_Optional_11_min.txt	13.0 KB
05_Detecting_Negative_Cycles_9_min.srt	14.7 KB
04_The_Basic_Algorithm_II_11_min.srt	16.4 KB
02_Optimal_Substructure_11_min.srt	16.9 KB
01_Single-Source_Shortest_Paths_Revisted_11_min.srt	17.9 KB
06_A_Space_Optimization_12_min.srt	19.1 KB
07_Internet_Routing_I_Optional_11_min.srt	19.4 KB
01_Single-Source_Shortest_Paths_Revisted_11_min.pdf	121.2 KB
08_Internet_Routing_II_Optional_7_min.pdf	128.2 KB
07_Internet_Routing_I_Optional_11_min.pdf	128.2 KB
05_Detecting_Negative_Cycles_9_min.pdf	133.3 KB
06_A_Space_Optimization_12_min.pdf	133.4 KB
02_Optimal_Substructure_11_min.pdf	136.1 KB
04_The_Basic_Algorithm_II_11_min.pdf	193.6 KB
03_The_Basic_Algorithm_I_9_min.pdf	193.6 KB
05_Detecting_Negative_Cycles_9_min_0_Slides_PDF.pdf	1.3 MB
08_Internet_Routing_II_Optional_7_min_0_Slides_PDF.pdf	1.8 MB
07_Internet_Routing_I_Optional_11_min_0_Slides_PDF.pdf	1.8 MB
01_Single-Source_Shortest_Paths_Revisted_11_min_0_Slides_PDF.pdf	1.9 MB
02_Optimal_Substructure_11_min_0_Slides_PDF.pdf	2.0 MB
06_A_Space_Optimization_12_min_0_Slides_PDF.pdf	2.3 MB
03_The_Basic_Algorithm_I_9_min_0_Slides_PDF.pdf	2.4 MB
04_The_Basic_Algorithm_II_11_min_0_Slides_PDF.pdf	2.4 MB
08_Internet_Routing_II_Optional_7_min.mp4	11.2 MB
03_The_Basic_Algorithm_I_9_min.mp4	12.7 MB
05_Detecting_Negative_Cycles_9_min.mp4	13.4 MB
04_The_Basic_Algorithm_II_11_min.mp4	14.3 MB
01_Single-Source_Shortest_Paths_Revisted_11_min.mp4	15.9 MB
02_Optimal_Substructure_11_min.mp4	16.0 MB
07_Internet_Routing_I_Optional_11_min.mp4	17.5 MB
06_A_Space_Optimization_12_min.mp4	19.2 MB
/.../17_XVII._FASTER_EXACT_ALGORITHMS_FOR_NP-COMPLETE_PROBLEMS_Week_5/
03_Smarter_Search_for_Vertex_Cover_II_8_min.txt	7.9 KB
01_The_Vertex_Cover_Problem_9_min.txt	9.2 KB
02_Smarter_Search_for_Vertex_Cover_I_10_min.txt	9.7 KB
03_Smarter_Search_for_Vertex_Cover_II_8_min.srt	11.7 KB
05_A_Dynamic_Programming_Algorithm_for_TSP_12_min.txt	12.4 KB
01_The_Vertex_Cover_Problem_9_min.srt	13.7 KB
02_Smarter_Search_for_Vertex_Cover_I_10_min.srt	14.4 KB
04_The_Traveling_Salesman_Problem_15_min.txt	15.7 KB
05_A_Dynamic_Programming_Algorithm_for_TSP_12_min.srt	18.4 KB
04_The_Traveling_Salesman_Problem_15_min.srt	23.7 KB
01_The_Vertex_Cover_Problem_9_min.pdf	112.3 KB
04_The_Traveling_Salesman_Problem_15_min.pdf	152.0 KB
03_Smarter_Search_for_Vertex_Cover_II_8_min.pdf	155.1 KB
02_Smarter_Search_for_Vertex_Cover_I_10_min.pdf	155.1 KB
05_A_Dynamic_Programming_Algorithm_for_TSP_12_min.pdf	185.2 KB
01_The_Vertex_Cover_Problem_9_min_0_Slides_PDF.pdf	1.3 MB
05_A_Dynamic_Programming_Algorithm_for_TSP_12_min_0_Slides_PDF.pdf	2.2 MB
02_Smarter_Search_for_Vertex_Cover_I_10_min_0_Slides_PDF.pdf	2.8 MB
03_Smarter_Search_for_Vertex_Cover_II_8_min_0_Slides_PDF.pdf	2.8 MB
04_The_Traveling_Salesman_Problem_15_min_0_Slides_PDF.pdf	3.1 MB
03_Smarter_Search_for_Vertex_Cover_II_8_min.mp4	10.9 MB
01_The_Vertex_Cover_Problem_9_min.mp4	13.4 MB
02_Smarter_Search_for_Vertex_Cover_I_10_min.mp4	14.8 MB
05_A_Dynamic_Programming_Algorithm_for_TSP_12_min.mp4	18.3 MB
04_The_Traveling_Salesman_Problem_15_min.mp4	22.0 MB
/.../16_XVI._NP-COMPLETE_PROBLEMS_Week_5/
04_Definition_and_Interpretation_of_NP-Completeness_II_8_min.txt	8.0 KB
05_The_P_vs._NP_Question_9_min.txt	9.1 KB
03_Definition_and_Interpretation_of_NP-Completeness_I_11_min.txt	10.8 KB
04_Definition_and_Interpretation_of_NP-Completeness_II_8_min.srt	11.9 KB
05_The_P_vs._NP_Question_9_min.srt	13.5 KB
02_Reductions_and_Completeness_14_min.txt	13.7 KB
06_Algorithmic_Approaches_to_NP-Complete_Problems_13_min.txt	14.1 KB
01_Polynomial-Time_Solvable_Problems_14_min.txt	14.7 KB
03_Definition_and_Interpretation_of_NP-Completeness_I_11_min.srt	16.1 KB
02_Reductions_and_Completeness_14_min.srt	20.4 KB
06_Algorithmic_Approaches_to_NP-Complete_Problems_13_min.srt	20.9 KB
01_Polynomial-Time_Solvable_Problems_14_min.srt	21.9 KB
02_Reductions_and_Completeness_14_min.pdf	85.0 KB
04_Definition_and_Interpretation_of_NP-Completeness_II_8_min.pdf	93.4 KB
03_Definition_and_Interpretation_of_NP-Completeness_I_11_min.pdf	93.4 KB
05_The_P_vs._NP_Question_9_min.pdf	94.9 KB
06_Algorithmic_Approaches_to_NP-Complete_Problems_13_min.pdf	105.2 KB
01_Polynomial-Time_Solvable_Problems_14_min.pdf	127.5 KB
06_Algorithmic_Approaches_to_NP-Complete_Problems_13_min_0_Slides_PDF.pdf	1.2 MB
05_The_P_vs._NP_Question_9_min_0_Slides_PDF.pdf	1.3 MB
02_Reductions_and_Completeness_14_min_0_Slides_PDF.pdf	1.8 MB
01_Polynomial-Time_Solvable_Problems_14_min_0_Slides_PDF.pdf	1.9 MB
04_Definition_and_Interpretation_of_NP-Completeness_II_8_min_0_Slides_PDF.pdf	2.3 MB
03_Definition_and_Interpretation_of_NP-Completeness_I_11_min_0_Slides_PDF.pdf	2.3 MB
04_Definition_and_Interpretation_of_NP-Completeness_II_8_min.mp4	12.8 MB
05_The_P_vs._NP_Question_9_min.mp4	15.0 MB
03_Definition_and_Interpretation_of_NP-Completeness_I_11_min.mp4	17.1 MB
06_Algorithmic_Approaches_to_NP-Complete_Problems_13_min.mp4	20.8 MB
02_Reductions_and_Completeness_14_min.mp4	20.8 MB
01_Polynomial-Time_Solvable_Problems_14_min.mp4	21.5 MB
/.../10_X._GRAPH_SEARCH_AND_CONNECTIVITY_Week_4/
03_BFS_and_Shortest_Paths_8_min.txt	8.4 KB
05_Depth-First_Search_DFS-_The_Basics_7_min.txt	8.6 KB
03_BFS_and_Shortest_Paths_8_min.srt	12.1 KB
05_Depth-First_Search_DFS-_The_Basics_7_min.srt	12.6 KB
04_BFS_and_Undirected_Connectivity_13_min.txt	15.5 KB
02_Breadth-First_Search_BFS-_The_Basics_14_min.txt	15.6 KB
09_Structure_of_the_Web_Optional_19_min.txt	20.6 KB
04_BFS_and_Undirected_Connectivity_13_min.srt	22.6 KB
02_Breadth-First_Search_BFS-_The_Basics_14_min.srt	22.8 KB
06_Topological_Sort_22_min.txt	23.2 KB
01_Graph_Search_-_Overview_23_min.txt	26.7 KB
08_Computing_Strong_Components-_The_Analysis_26_min.txt	27.6 KB
09_Structure_of_the_Web_Optional_19_min.srt	30.1 KB
07_Computing_Strong_Components-_The_Algorithm_29_min.txt	32.4 KB
06_Topological_Sort_22_min.srt	33.9 KB
01_Graph_Search_-_Overview_23_min.srt	39.0 KB
08_Computing_Strong_Components-_The_Analysis_26_min.srt	40.4 KB
07_Computing_Strong_Components-_The_Algorithm_29_min.srt	47.3 KB
07_Computing_Strong_Components-_The_Algorithm_29_min.pdf	93.8 KB
09_Structure_of_the_Web_Optional_19_min.pdf	251.4 KB
08_Computing_Strong_Components-_The_Analysis_26_min.pdf	473.5 KB
07_Computing_Strong_Components-_The_Algorithm_29_min_1_TYPED.pdf	1.6 MB
09_Structure_of_the_Web_Optional_19_min_0_PDF.pdf	1.8 MB
09_Structure_of_the_Web_Optional_19_min.pptx	2.1 MB
01_Graph_Search_-_Overview_23_min.pdf	2.1 MB
05_Depth-First_Search_DFS-_The_Basics_7_min.pdf	2.2 MB
06_Topological_Sort_22_min.pdf	2.2 MB
01_Graph_Search_-_Overview_23_min_0_PDF.pdf	2.4 MB
07_Computing_Strong_Components-_The_Algorithm_29_min.pptx	2.6 MB
08_Computing_Strong_Components-_The_Analysis_26_min_0_PDF.pdf	2.6 MB
01_Graph_Search_-_Overview_23_min.pptx	2.7 MB
04_BFS_and_Undirected_Connectivity_13_min.pdf	2.8 MB
02_Breadth-First_Search_BFS-_The_Basics_14_min.pdf	2.8 MB
03_BFS_and_Shortest_Paths_8_min.pdf	2.8 MB
07_Computing_Strong_Components-_The_Algorithm_29_min_0_PDF.pdf	2.9 MB
02_Breadth-First_Search_BFS-_The_Basics_14_min_0_PDF.pdf	2.9 MB
04_BFS_and_Undirected_Connectivity_13_min_0_PDF.pdf	2.9 MB
03_BFS_and_Shortest_Paths_8_min_0_PDF.pdf	2.9 MB
08_Computing_Strong_Components-_The_Analysis_26_min.pptx	2.9 MB
05_Depth-First_Search_DFS-_The_Basics_7_min_0_PDF.pdf	3.3 MB
06_Topological_Sort_22_min_0_PDF.pdf	3.3 MB
02_Breadth-First_Search_BFS-_The_Basics_14_min.pptx	3.3 MB
03_BFS_and_Shortest_Paths_8_min.pptx	3.3 MB
04_BFS_and_Undirected_Connectivity_13_min.pptx	3.3 MB
06_Topological_Sort_22_min.pptx	3.6 MB
05_Depth-First_Search_DFS-_The_Basics_7_min.pptx	3.6 MB
05_Depth-First_Search_DFS-_The_Basics_7_min.mp4	7.5 MB
03_BFS_and_Shortest_Paths_8_min.mp4	8.3 MB
04_BFS_and_Undirected_Connectivity_13_min.mp4	14.4 MB
02_Breadth-First_Search_BFS-_The_Basics_14_min.mp4	15.0 MB
09_Structure_of_the_Web_Optional_19_min.mp4	19.5 MB
06_Topological_Sort_22_min.mp4	23.2 MB
01_Graph_Search_-_Overview_23_min.mp4	24.4 MB
08_Computing_Strong_Components-_The_Analysis_26_min.mp4	28.1 MB
07_Computing_Strong_Components-_The_Algorithm_29_min.mp4	30.9 MB
/.../17_PREVIEW_OF_PART_2/
05_Principles_of_Dynamic_Programming_Optional_8_min.txt	8.4 KB
02_Application-_Sequence_Alignment_Optional_9_min.txt	9.0 KB
06_The_P_vs._NP_Question_Optional_9_min.txt	9.0 KB
04_Huffman_Codes-_Introduction_and_Motivation_Optional_9_min.txt	9.7 KB
01_Application-_Internet_Routing_Optional_11_min.txt	12.2 KB
05_Principles_of_Dynamic_Programming_Optional_8_min.srt	12.6 KB
02_Application-_Sequence_Alignment_Optional_9_min.srt	13.4 KB
06_The_P_vs._NP_Question_Optional_9_min.srt	13.6 KB
07_Algorithmic_Approaches_to_NP-Complete_Problems_Optional_13_min.txt	14.0 KB
04_Huffman_Codes-_Introduction_and_Motivation_Optional_9_min.srt	14.5 KB
03_Introduction_to_Greedy_Algorithms_Optional_13_min.txt	14.9 KB
01_Application-_Internet_Routing_Optional_11_min.srt	18.2 KB
07_Algorithmic_Approaches_to_NP-Complete_Problems_Optional_13_min.srt	21.0 KB
03_Introduction_to_Greedy_Algorithms_Optional_13_min.srt	22.3 KB
05_Principles_of_Dynamic_Programming_Optional_8_min.pdf	882.8 KB
07_Algorithmic_Approaches_to_NP-Complete_Problems_Optional_13_min.pdf	1.2 MB
06_The_P_vs._NP_Question_Optional_9_min.pdf	1.3 MB
01_Application-_Internet_Routing_Optional_11_min.pdf	1.5 MB
04_Huffman_Codes-_Introduction_and_Motivation_Optional_9_min.pdf	1.7 MB
03_Introduction_to_Greedy_Algorithms_Optional_13_min.pdf	1.8 MB
02_Application-_Sequence_Alignment_Optional_9_min.pdf	2.2 MB
02_Application-_Sequence_Alignment_Optional_9_min.mp4	11.6 MB
04_Huffman_Codes-_Introduction_and_Motivation_Optional_9_min.mp4	12.5 MB
05_Principles_of_Dynamic_Programming_Optional_8_min.mp4	12.9 MB
01_Application-_Internet_Routing_Optional_11_min.mp4	14.5 MB
06_The_P_vs._NP_Question_Optional_9_min.mp4	15.0 MB
03_Introduction_to_Greedy_Algorithms_Optional_13_min.mp4	18.9 MB
07_Algorithmic_Approaches_to_NP-Complete_Problems_Optional_13_min.mp4	20.8 MB
/.../06_VI._QUICKSORT_-_ANALYSIS_Week_2/
03_Analysis_III-_Final_Calculations_Advanced_-_Optional_9min.txt	8.5 KB
02_Analysis_II-_The_Key_Insight_Advanced_-_Optional_12min.txt	11.1 KB
03_Analysis_III-_Final_Calculations_Advanced_-_Optional_9min.srt	12.4 KB
02_Analysis_II-_The_Key_Insight_Advanced_-_Optional_12min.srt	17.8 KB
01_Analysis_I-_A_Decomposition_Principle__Advanced_-_Optional_22_min.txt	23.3 KB
01_Analysis_I-_A_Decomposition_Principle__Advanced_-_Optional_22_min.srt	34.1 KB
03_Analysis_III-_Final_Calculations_Advanced_-_Optional_9min.pdf	85.8 KB
02_Analysis_II-_The_Key_Insight_Advanced_-_Optional_12min.pdf	308.6 KB
03_Analysis_III-_Final_Calculations_Advanced_-_Optional_9min_1_TYPED.pdf	1.0 MB
03_Analysis_III-_Final_Calculations_Advanced_-_Optional_9min_0_PDF.pdf	1.1 MB
03_Analysis_III-_Final_Calculations_Advanced_-_Optional_9min.pptx	1.3 MB
01_Analysis_I-_A_Decomposition_Principle__Advanced_-_Optional_22_min.pdf	1.5 MB
02_Analysis_II-_The_Key_Insight_Advanced_-_Optional_12min_0_PDF.pdf	1.8 MB
02_Analysis_II-_The_Key_Insight_Advanced_-_Optional_12min.pptx	2.1 MB
01_Analysis_I-_A_Decomposition_Principle__Advanced_-_Optional_22_min_0_PDF.pdf	2.3 MB
01_Analysis_I-_A_Decomposition_Principle__Advanced_-_Optional_22_min.pptx	2.6 MB
03_Analysis_III-_Final_Calculations_Advanced_-_Optional_9min.mp4	9.4 MB
02_Analysis_II-_The_Key_Insight_Advanced_-_Optional_12min.mp4	12.6 MB
01_Analysis_I-_A_Decomposition_Principle__Advanced_-_Optional_22_min.mp4	22.7 MB
/.../05_V._PRIMS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_1/
04_Correctness_Proof_II_8_min.txt	8.6 KB
02_Prims_MST_Algorithm_8_min.txt	8.7 KB
07_Fast_Implementation_II_10_min.txt	10.4 KB
01_MST_Problem_Definition_11_min.txt	12.5 KB
04_Correctness_Proof_II_8_min.srt	13.0 KB
02_Prims_MST_Algorithm_8_min.srt	13.0 KB
05_Proof_of_Cut_Property_Advanced_-_Optional_12_min.txt	13.1 KB
07_Fast_Implementation_II_10_min.srt	15.7 KB
03_Correctness_Proof_I_16_min.txt	15.9 KB
06_Fast_Implementation_I_15_min.txt	16.1 KB
01_MST_Problem_Definition_11_min.srt	18.6 KB
05_Proof_of_Cut_Property_Advanced_-_Optional_12_min.srt	19.9 KB
06_Fast_Implementation_I_15_min.srt	24.0 KB
03_Correctness_Proof_I_16_min.srt	24.1 KB
02_Prims_MST_Algorithm_8_min.pdf	107.8 KB
04_Correctness_Proof_II_8_min.pdf	116.4 KB
01_MST_Problem_Definition_11_min.pdf	120.8 KB
07_Fast_Implementation_II_10_min.pdf	142.4 KB
06_Fast_Implementation_I_15_min.pdf	142.4 KB
03_Correctness_Proof_I_16_min.pdf	148.1 KB
05_Proof_of_Cut_Property_Advanced_-_Optional_12_min.pdf	163.9 KB
04_Correctness_Proof_II_8_min_0_Slides_PDF.pdf	1.1 MB
02_Prims_MST_Algorithm_8_min_0_Slides_PDF.pdf	1.2 MB
01_MST_Problem_Definition_11_min_0_Slides_PDF.pdf	1.7 MB
05_Proof_of_Cut_Property_Advanced_-_Optional_12_min_0_Slides_PDF.pdf	2.3 MB
03_Correctness_Proof_I_16_min_0_Slides_PDF.pdf	2.6 MB
06_Fast_Implementation_I_15_min_0_Slides_PDF.pdf	3.5 MB
07_Fast_Implementation_II_10_min_0_Slides_PDF.pdf	3.5 MB
02_Prims_MST_Algorithm_8_min.mp4	10.5 MB
04_Correctness_Proof_II_8_min.mp4	10.6 MB
07_Fast_Implementation_II_10_min.mp4	13.8 MB
05_Proof_of_Cut_Property_Advanced_-_Optional_12_min.mp4	15.7 MB
01_MST_Problem_Definition_11_min.mp4	15.7 MB
03_Correctness_Proof_I_16_min.mp4	19.9 MB
06_Fast_Implementation_I_15_min.mp4	20.6 MB
/.../04_IV._THE_MASTER_METHOD_Week_2/
01_Motivation_8_min.txt	8.6 KB
02_Formal_Statement_10_min.txt	10.1 KB
04_Proof_I_10_min.txt	10.8 KB
05_Interpretation_of_the_3_Cases_11_min.txt	12.1 KB
01_Motivation_8_min.srt	12.6 KB
03_Examples_13_min.txt	13.5 KB
02_Formal_Statement_10_min.srt	14.8 KB
04_Proof_I_10_min.srt	15.7 KB
06_Proof_II_16_min.txt	17.2 KB
05_Interpretation_of_the_3_Cases_11_min.srt	17.6 KB
03_Examples_13_min.srt	19.6 KB
06_Proof_II_16_min.srt	25.0 KB
05_Interpretation_of_the_3_Cases_11_min.pdf	283.6 KB
02_Formal_Statement_10_min.pdf	370.9 KB
01_Motivation_8_min.pdf	467.6 KB
05_Interpretation_of_the_3_Cases_11_min_0_PDF.pdf	651.7 KB
06_Proof_II_16_min.pdf	845.5 KB
03_Examples_13_min.pdf	875.7 KB
02_Formal_Statement_10_min_0_PDF.pdf	887.9 KB
05_Interpretation_of_the_3_Cases_11_min.pptx	902.3 KB
04_Proof_I_10_min.pdf	967.0 KB
03_Examples_13_min_0_PDF.pdf	1.1 MB
02_Formal_Statement_10_min.pptx	1.1 MB
03_Examples_13_min.pptx	1.3 MB
04_Proof_I_10_min_0_PDF.pdf	1.3 MB
04_Proof_I_10_min.pptx	1.4 MB
06_Proof_II_16_min_0_PDF.pdf	1.5 MB
01_Motivation_8_min_0_PDF.pdf	1.5 MB
01_Motivation_8_min.pptx	1.6 MB
06_Proof_II_16_min.pptx	1.7 MB
01_Motivation_8_min.mp4	8.7 MB
02_Formal_Statement_10_min.mp4	10.9 MB
04_Proof_I_10_min.mp4	12.0 MB
05_Interpretation_of_the_3_Cases_11_min.mp4	13.8 MB
03_Examples_13_min.mp4	15.1 MB
06_Proof_II_16_min.mp4	17.4 MB
/.../19_XIX._LOCAL_SEARCH_ALGORITHMS_Week_6/
01_The_Maximum_Cut_Problem_I_9_min.txt	8.8 KB
03_Principles_of_Local_Search_I_9_min.txt	9.9 KB
02_The_Maximum_Cut_Problem_II_9_min.txt	10.1 KB
04_Principles_of_Local_Search_II_10_min.txt	12.2 KB
01_The_Maximum_Cut_Problem_I_9_min.srt	13.0 KB
07_Analysis_of_Papadimitrious_Algorithm_15_min.txt	14.7 KB
03_Principles_of_Local_Search_I_9_min.srt	14.8 KB
02_The_Maximum_Cut_Problem_II_9_min.srt	15.0 KB
05_The_2-SAT_Problem_15_min.txt	15.4 KB
06_Random_Walks_on_a_Line_16_min.txt	16.6 KB
04_Principles_of_Local_Search_II_10_min.srt	18.1 KB
07_Analysis_of_Papadimitrious_Algorithm_15_min.srt	22.0 KB
05_The_2-SAT_Problem_15_min.srt	22.9 KB
06_Random_Walks_on_a_Line_16_min.srt	24.8 KB
03_Principles_of_Local_Search_I_9_min.pdf	113.6 KB
04_Principles_of_Local_Search_II_10_min.pdf	113.6 KB
05_The_2-SAT_Problem_15_min.pdf	124.1 KB
07_Analysis_of_Papadimitrious_Algorithm_15_min.pdf	145.5 KB
01_The_Maximum_Cut_Problem_I_9_min.pdf	199.3 KB
02_The_Maximum_Cut_Problem_II_9_min.pdf	199.3 KB
06_Random_Walks_on_a_Line_16_min.pdf	207.0 KB
05_The_2-SAT_Problem_15_min_0_Slides_PDF.pdf	1.8 MB
06_Random_Walks_on_a_Line_16_min_0_Slides_PDF.pdf	2.4 MB
07_Analysis_of_Papadimitrious_Algorithm_15_min_0_Slides_PDF.pdf	2.6 MB
04_Principles_of_Local_Search_II_10_min_0_Slides_PDF.pdf	2.8 MB
03_Principles_of_Local_Search_I_9_min_0_Slides_PDF.pdf	2.8 MB
02_The_Maximum_Cut_Problem_II_9_min_0_Slides_PDF.pdf	3.2 MB
01_The_Maximum_Cut_Problem_I_9_min_0_Slides_PDF.pdf	3.2 MB
03_Principles_of_Local_Search_I_9_min.mp4	12.8 MB
01_The_Maximum_Cut_Problem_I_9_min.mp4	13.0 MB
02_The_Maximum_Cut_Problem_II_9_min.mp4	13.5 MB
04_Principles_of_Local_Search_II_10_min.mp4	15.2 MB
05_The_2-SAT_Problem_15_min.mp4	20.6 MB
06_Random_Walks_on_a_Line_16_min.mp4	22.4 MB
07_Analysis_of_Papadimitrious_Algorithm_15_min.mp4	22.7 MB
/.../06_VI._KRUSKALS_MINIMUM_SPANNING_TREE_ALGORITHM_Week_2/
01_Kruskals_MST_Algorithm_8_min.txt	9.0 KB
02_Correctness_of_Kruskals_Algorithm_9_min.txt	10.1 KB
05_MSTs-_State-of-the-Art_and_Open_Questions_Advanced_-_Optional_9_min.txt	10.2 KB
03_Implementing_Kruskals_Algorithm_via_Union-Find_I_9_min.txt	10.7 KB
01_Kruskals_MST_Algorithm_8_min.srt	13.6 KB
04_Implementing_Kruskals_Algorithm_via_Union-Find_II_14_min.txt	15.3 KB
02_Correctness_of_Kruskals_Algorithm_9_min.srt	15.3 KB
05_MSTs-_State-of-the-Art_and_Open_Questions_Advanced_-_Optional_9_min.srt	15.3 KB
03_Implementing_Kruskals_Algorithm_via_Union-Find_I_9_min.srt	16.1 KB
04_Implementing_Kruskals_Algorithm_via_Union-Find_II_14_min.srt	23.1 KB
05_MSTs-_State-of-the-Art_and_Open_Questions_Advanced_-_Optional_9_min.pdf	106.3 KB
01_Kruskals_MST_Algorithm_8_min.pdf	107.4 KB
02_Correctness_of_Kruskals_Algorithm_9_min.pdf	121.5 KB
04_Implementing_Kruskals_Algorithm_via_Union-Find_II_14_min.pdf	141.8 KB
03_Implementing_Kruskals_Algorithm_via_Union-Find_I_9_min.pdf	141.8 KB
01_Kruskals_MST_Algorithm_8_min_0_Slides_PDF.pdf	769.7 KB
05_MSTs-_State-of-the-Art_and_Open_Questions_Advanced_-_Optional_9_min_0_Slides_PDF.pdf	1.3 MB
02_Correctness_of_Kruskals_Algorithm_9_min_0_Slides_PDF.pdf	1.6 MB
04_Implementing_Kruskals_Algorithm_via_Union-Find_II_14_min_0_Slides_PDF.pdf	3.6 MB
03_Implementing_Kruskals_Algorithm_via_Union-Find_I_9_min_0_Slides_PDF.pdf	3.6 MB
01_Kruskals_MST_Algorithm_8_min.mp4	11.6 MB
02_Correctness_of_Kruskals_Algorithm_9_min.mp4	12.9 MB
03_Implementing_Kruskals_Algorithm_via_Union-Find_I_9_min.mp4	13.5 MB
05_MSTs-_State-of-the-Art_and_Open_Questions_Advanced_-_Optional_9_min.mp4	14.9 MB
04_Implementing_Kruskals_Algorithm_via_Union-Find_II_14_min.mp4	19.8 MB
/.../01_I._TWO_MOTIVATING_APPLICATIONS_Week_1/
02_Application-_Sequence_Alignment_9_min.txt	9.1 KB
01_Application-_Internet_Routing_11_min.txt	12.3 KB
02_Application-_Sequence_Alignment_9_min.srt	13.7 KB
01_Application-_Internet_Routing_11_min.srt	18.2 KB
01_Application-_Internet_Routing_11_min.pdf	93.0 KB
02_Application-_Sequence_Alignment_9_min.pdf	104.9 KB
01_Application-_Internet_Routing_11_min_0_Slides_PDF.pdf	1.5 MB
02_Application-_Sequence_Alignment_9_min_0_Slides_PDF.pdf	2.2 MB
02_Application-_Sequence_Alignment_9_min.mp4	11.6 MB
01_Application-_Internet_Routing_11_min.mp4	14.5 MB
/.../08_VIII._ADVANCED_UNION-FIND_Week_2/
05_Path_Compression-_The_Hopcroft-Ullman_Analysis_I_Advanced_-_Optional_9_min.txt	9.6 KB
01_Lazy_Unions_Advanced_-_Optional_10_min.txt	10.9 KB
06_Path_Compression-_The_Hopcroft-Ullman_Analysis_II_Advanced_-_Optional_12_min.txt	11.7 KB
02_Union-by-Rank_Advanced_-_Optional_12_min.txt	13.4 KB
09_Path_Compression-_Tarjans_Analysis_II_Advanced_-_Optional_14_min.txt	13.5 KB
05_Path_Compression-_The_Hopcroft-Ullman_Analysis_I_Advanced_-_Optional_9_min.srt	14.5 KB
08_Path_Compression-_Tarjans_Analysis_I_Advanced_-_Optional_14_min.txt	14.6 KB
07_The_Ackermann_Function_Advanced_-_Optional_17_min.txt	14.8 KB
04_Path_Compression_Advanced_-_Optional_15_min.txt	15.0 KB
03_Analysis_of_Union-by-Rank_Advanced_-_Optional_15_min.txt	15.4 KB
01_Lazy_Unions_Advanced_-_Optional_10_min.srt	16.4 KB
06_Path_Compression-_The_Hopcroft-Ullman_Analysis_II_Advanced_-_Optional_12_min.srt	17.7 KB
02_Union-by-Rank_Advanced_-_Optional_12_min.srt	20.1 KB
09_Path_Compression-_Tarjans_Analysis_II_Advanced_-_Optional_14_min.srt	20.2 KB
08_Path_Compression-_Tarjans_Analysis_I_Advanced_-_Optional_14_min.srt	21.7 KB
07_The_Ackermann_Function_Advanced_-_Optional_17_min.srt	22.3 KB
04_Path_Compression_Advanced_-_Optional_15_min.srt	22.6 KB
03_Analysis_of_Union-by-Rank_Advanced_-_Optional_15_min.srt	23.1 KB
01_Lazy_Unions_Advanced_-_Optional_10_min.pdf	140.6 KB
04_Path_Compression_Advanced_-_Optional_15_min.pdf	144.7 KB
03_Analysis_of_Union-by-Rank_Advanced_-_Optional_15_min.pdf	145.9 KB
02_Union-by-Rank_Advanced_-_Optional_12_min.pdf	154.9 KB
05_Path_Compression-_The_Hopcroft-Ullman_Analysis_I_Advanced_-_Optional_9_min.pdf	158.3 KB
06_Path_Compression-_The_Hopcroft-Ullman_Analysis_II_Advanced_-_Optional_12_min.pdf	158.3 KB
07_The_Ackermann_Function_Advanced_-_Optional_17_min.pdf	164.1 KB
09_Path_Compression-_Tarjans_Analysis_II_Advanced_-_Optional_14_min.pdf	185.6 KB
08_Path_Compression-_Tarjans_Analysis_I_Advanced_-_Optional_14_min.pdf	185.6 KB
01_Lazy_Unions_Advanced_-_Optional_10_min_0_Slides_PDF.pdf	1.7 MB
04_Path_Compression_Advanced_-_Optional_15_min_0_Slides_PDF.pdf	2.1 MB
02_Union-by-Rank_Advanced_-_Optional_12_min_0_Slides_PDF.pdf	2.2 MB
07_The_Ackermann_Function_Advanced_-_Optional_17_min_0_Slides_PDF.pdf	2.6 MB
03_Analysis_of_Union-by-Rank_Advanced_-_Optional_15_min_0_Slides_PDF.pdf	2.8 MB
06_Path_Compression-_The_Hopcroft-Ullman_Analysis_II_Advanced_-_Optional_12_min_0_Slides_PDF.pdf	3.2 MB
05_Path_Compression-_The_Hopcroft-Ullman_Analysis_I_Advanced_-_Optional_9_min_0_Slides_PDF.pdf	3.2 MB
08_Path_Compression-_Tarjans_Analysis_I_Advanced_-_Optional_14_min_0_Slides_PDF.pdf	3.6 MB
09_Path_Compression-_Tarjans_Analysis_II_Advanced_-_Optional_14_min_0_Slides_PDF.pdf	3.6 MB
05_Path_Compression-_The_Hopcroft-Ullman_Analysis_I_Advanced_-_Optional_9_min.mp4	14.3 MB
01_Lazy_Unions_Advanced_-_Optional_10_min.mp4	16.0 MB
06_Path_Compression-_The_Hopcroft-Ullman_Analysis_II_Advanced_-_Optional_12_min.mp4	18.0 MB
02_Union-by-Rank_Advanced_-_Optional_12_min.mp4	19.1 MB
09_Path_Compression-_Tarjans_Analysis_II_Advanced_-_Optional_14_min.mp4	20.0 MB
08_Path_Compression-_Tarjans_Analysis_I_Advanced_-_Optional_14_min.mp4	21.8 MB
04_Path_Compression_Advanced_-_Optional_15_min.mp4	22.6 MB
03_Analysis_of_Union-by-Rank_Advanced_-_Optional_15_min.mp4	23.4 MB
07_The_Ackermann_Function_Advanced_-_Optional_17_min.mp4	23.7 MB
/.../05_V._QUICKSORT_-_ALGORITHM_Week_2/
03_Correctness_of_Quicksort_Review_-_Optional_11_min.txt	9.8 KB
01_Quicksort-_Overview_12_min.txt	12.4 KB
03_Correctness_of_Quicksort_Review_-_Optional_11_min.srt	14.3 KB
01_Quicksort-_Overview_12_min.srt	18.2 KB
04_Choosing_a_Good_Pivot_22min.txt	24.4 KB
02_Partitioning_Around_a_Pivot_25_min.txt	25.6 KB
04_Choosing_a_Good_Pivot_22min.srt	35.8 KB
02_Partitioning_Around_a_Pivot_25_min.srt	37.6 KB
03_Correctness_of_Quicksort_Review_-_Optional_11_min.pdf	1.1 MB
01_Quicksort-_Overview_12_min_0_PDF.pdf	1.2 MB
01_Quicksort-_Overview_12_min.pdf	1.4 MB
01_Quicksort-_Overview_12_min.pptx	1.5 MB
03_Correctness_of_Quicksort_Review_-_Optional_11_min_0_PDF.pdf	1.5 MB
04_Choosing_a_Good_Pivot_22min.pdf	1.5 MB
04_Choosing_a_Good_Pivot_22min_0_PDF.pdf	1.7 MB
03_Correctness_of_Quicksort_Review_-_Optional_11_min.pptx	1.8 MB
04_Choosing_a_Good_Pivot_22min.pptx	2.0 MB
02_Partitioning_Around_a_Pivot_25_min_0_PDF.pdf	2.8 MB
02_Partitioning_Around_a_Pivot_25_min.pptx	3.1 MB
02_Partitioning_Around_a_Pivot_25_min.pdf	4.1 MB
03_Correctness_of_Quicksort_Review_-_Optional_11_min.mp4	12.4 MB
01_Quicksort-_Overview_12_min.mp4	12.8 MB
04_Choosing_a_Good_Pivot_22min.mp4	22.8 MB
02_Partitioning_Around_a_Pivot_25_min.mp4	26.1 MB
/.../11_XI._THE_KNAPSACK_PROBLEM_Week_3/
01_The_Knapsack_Problem_10_min.txt	9.9 KB
02_A_Dynamic_Programming_Algorithm_10_min.txt	10.1 KB
03_Example_Review_-_Optional_14_min.txt	13.2 KB
01_The_Knapsack_Problem_10_min.srt	14.8 KB
02_A_Dynamic_Programming_Algorithm_10_min.srt	15.2 KB
03_Example_Review_-_Optional_14_min.srt	22.1 KB
01_The_Knapsack_Problem_10_min.pdf	122.3 KB
02_A_Dynamic_Programming_Algorithm_10_min.pdf	123.8 KB
03_Example_Review_-_Optional_14_min.pdf	143.3 KB
03_Example_Review_-_Optional_14_min_0_Slides_PDF.pdf	788.2 KB
02_A_Dynamic_Programming_Algorithm_10_min_0_Slides_PDF.pdf	1.5 MB
01_The_Knapsack_Problem_10_min_0_Slides_PDF.pdf	1.6 MB
02_A_Dynamic_Programming_Algorithm_10_min.mp4	14.3 MB
01_The_Knapsack_Problem_10_min.mp4	14.8 MB
03_Example_Review_-_Optional_14_min.mp4	25.4 MB
/.../07_VII._CLUSTERING_Week_2/
02_Correctness_of_Clustering_Algorithm_10_min.txt	11.1 KB
01_Application_to_Clustering_12_min.txt	12.6 KB
02_Correctness_of_Clustering_Algorithm_10_min.srt	16.7 KB
01_Application_to_Clustering_12_min.srt	18.9 KB
01_Application_to_Clustering_12_min.pdf	137.2 KB
02_Correctness_of_Clustering_Algorithm_10_min.pdf	145.9 KB
02_Correctness_of_Clustering_Algorithm_10_min_0_Slides_PDF.pdf	1.7 MB
01_Application_to_Clustering_12_min_0_Slides_PDF.pdf	1.9 MB
02_Correctness_of_Clustering_Algorithm_10_min.mp4	12.5 MB
01_Application_to_Clustering_12_min.mp4	15.9 MB
/.../03_III._INTRODUCTION_TO_GREEDY_ALGORITHMS_Week_1/
02_Application-_Optimal_Caching_11_min.txt	11.6 KB
01_Introduction_to_Greedy_Algorithms_13_min.txt	14.8 KB
02_Application-_Optimal_Caching_11_min.srt	17.4 KB
01_Introduction_to_Greedy_Algorithms_13_min.srt	22.3 KB
02_Application-_Optimal_Caching_11_min.pdf	83.6 KB
01_Introduction_to_Greedy_Algorithms_13_min.pdf	93.5 KB
02_Application-_Optimal_Caching_11_min_0_Slides_PDF.pdf	1.2 MB
01_Introduction_to_Greedy_Algorithms_13_min_0_Slides_PDF.pdf	1.8 MB
02_Application-_Optimal_Caching_11_min.mp4	15.7 MB
01_Introduction_to_Greedy_Algorithms_13_min.mp4	18.9 MB
/.../12_XII._SEQUENCE_ALIGNMENT_Week_3/
02_A_Dynamic_Programming_Algorithm_12_min.txt	13.1 KB
01_Optimal_Substructure_14_min.txt	14.4 KB
02_A_Dynamic_Programming_Algorithm_12_min.srt	19.6 KB
01_Optimal_Substructure_14_min.srt	21.6 KB
01_Optimal_Substructure_14_min.pdf	145.8 KB
02_A_Dynamic_Programming_Algorithm_12_min.pdf	160.6 KB
02_A_Dynamic_Programming_Algorithm_12_min_0_Slides_PDF.pdf	2.4 MB
01_Optimal_Substructure_14_min_0_Slides_PDF.pdf	2.5 MB
02_A_Dynamic_Programming_Algorithm_12_min.mp4	17.5 MB
01_Optimal_Substructure_14_min.mp4	20.5 MB
/.../11_XI._DIJKSTRAS_SHORTEST-PATH_ALGORITHM_Week_5/
02_Dijkstras_Algorithm-_Examples_13_min.txt	13.2 KB
03_Correctness_of_Dijkstras_Algorithm_Advanced_-_Optional_19_min.txt	19.1 KB
02_Dijkstras_Algorithm-_Examples_13_min.srt	19.3 KB
01_Dijkstras_Shortest-Path_Algorithm_21_min.txt	22.6 KB
03_Correctness_of_Dijkstras_Algorithm_Advanced_-_Optional_19_min.srt	28.0 KB
04_Dijkstras_Algorithm-_Implementation_and_Running_Time_26_min.txt	28.4 KB
01_Dijkstras_Shortest-Path_Algorithm_21_min.srt	32.9 KB
04_Dijkstras_Algorithm-_Implementation_and_Running_Time_26_min.srt	41.5 KB
02_Dijkstras_Algorithm-_Examples_13_min.pdf	443.1 KB
01_Dijkstras_Shortest-Path_Algorithm_21_min.pdf	443.1 KB
03_Correctness_of_Dijkstras_Algorithm_Advanced_-_Optional_19_min.pdf	444.3 KB
04_Dijkstras_Algorithm-_Implementation_and_Running_Time_26_min.pdf	453.6 KB
01_Dijkstras_Shortest-Path_Algorithm_21_min_0_PDF.pdf	2.8 MB
02_Dijkstras_Algorithm-_Examples_13_min_0_PDF.pdf	2.8 MB
03_Correctness_of_Dijkstras_Algorithm_Advanced_-_Optional_19_min_0_PDF.pdf	2.9 MB
02_Dijkstras_Algorithm-_Examples_13_min.pptx	3.2 MB
01_Dijkstras_Shortest-Path_Algorithm_21_min.pptx	3.2 MB
03_Correctness_of_Dijkstras_Algorithm_Advanced_-_Optional_19_min.pptx	3.3 MB
04_Dijkstras_Algorithm-_Implementation_and_Running_Time_26_min_0_PDF.pdf	3.6 MB
04_Dijkstras_Algorithm-_Implementation_and_Running_Time_26_min.pptx	4.0 MB
02_Dijkstras_Algorithm-_Examples_13_min.mp4	13.5 MB
03_Correctness_of_Dijkstras_Algorithm_Advanced_-_Optional_19_min.mp4	21.3 MB
01_Dijkstras_Shortest-Path_Algorithm_21_min.mp4	22.0 MB
04_Dijkstras_Algorithm-_Implementation_and_Running_Time_26_min.mp4	27.7 MB
/.../16_XV._BLOOM_FILTERS_Week_6/
02_Bloom_Filters-_Heuristic_Analysis_13_min.txt	14.0 KB
01_Bloom_Filters-_The_Basics_16_min.txt	18.5 KB
02_Bloom_Filters-_Heuristic_Analysis_13_min.srt	20.4 KB
01_Bloom_Filters-_The_Basics_16_min.srt	27.0 KB
02_Bloom_Filters-_Heuristic_Analysis_13_min.pdf	190.3 KB
01_Bloom_Filters-_The_Basics_16_min.pdf	190.3 KB
02_Bloom_Filters-_Heuristic_Analysis_13_min.pptx	2.5 MB
01_Bloom_Filters-_The_Basics_16_min.pptx	2.5 MB
02_Bloom_Filters-_Heuristic_Analysis_13_min_0_PDF.pdf	2.5 MB
01_Bloom_Filters-_The_Basics_16_min_0_PDF.pdf	2.5 MB
02_Bloom_Filters-_Heuristic_Analysis_13_min.mp4	14.2 MB
01_Bloom_Filters-_The_Basics_16_min.mp4	16.2 MB
/.../03_III._DIVIDE__CONQUER_ALGORITHMS_Week_1/
01_On_log_n_Algorithm_for_Counting_Inversions_I_13_min.txt	14.1 KB
02_On_log_n_Algorithm_for_Counting_Inversions_II_17_min.txt	19.0 KB
05_On_log_n_Algorithm_for_Closest_Pair_II_Advanced_-_Optional_19_min.txt	20.4 KB
01_On_log_n_Algorithm_for_Counting_Inversions_I_13_min.srt	20.6 KB
03_Strassens_Subcubic_Matrix_Multiplication_Algorithm_22_min.txt	21.9 KB
02_On_log_n_Algorithm_for_Counting_Inversions_II_17_min.srt	27.9 KB
05_On_log_n_Algorithm_for_Closest_Pair_II_Advanced_-_Optional_19_min.srt	29.8 KB
03_Strassens_Subcubic_Matrix_Multiplication_Algorithm_22_min.srt	32.1 KB
04_On_log_n_Algorithm_for_Closest_Pair_I_Advanced_-_Optional_32_min.txt	37.2 KB
04_On_log_n_Algorithm_for_Closest_Pair_I_Advanced_-_Optional_32_min.srt	53.2 KB
02_On_log_n_Algorithm_for_Counting_Inversions_II_17_min.pdf	463.2 KB
01_On_log_n_Algorithm_for_Counting_Inversions_I_13_min.pdf	937.1 KB
01_On_log_n_Algorithm_for_Counting_Inversions_I_13_min_0_PDF.pdf	1.3 MB
01_On_log_n_Algorithm_for_Counting_Inversions_I_13_min.pptx	1.6 MB
03_Strassens_Subcubic_Matrix_Multiplication_Algorithm_22_min_0_PDF.pdf	1.8 MB
03_Strassens_Subcubic_Matrix_Multiplication_Algorithm_22_min.pdf	1.9 MB
02_On_log_n_Algorithm_for_Counting_Inversions_II_17_min_0_PDF.pdf	2.1 MB
05_On_log_n_Algorithm_for_Closest_Pair_II_Advanced_-_Optional_19_min_0_PDF.pdf	2.1 MB
03_Strassens_Subcubic_Matrix_Multiplication_Algorithm_22_min.pptx	2.1 MB
04_On_log_n_Algorithm_for_Closest_Pair_I_Advanced_-_Optional_32_min.pdf	2.2 MB
05_On_log_n_Algorithm_for_Closest_Pair_II_Advanced_-_Optional_19_min.pptx	2.3 MB
02_On_log_n_Algorithm_for_Counting_Inversions_II_17_min.pptx	2.3 MB
04_On_log_n_Algorithm_for_Closest_Pair_I_Advanced_-_Optional_32_min_0_PDF.pdf	3.3 MB
04_On_log_n_Algorithm_for_Closest_Pair_I_Advanced_-_Optional_32_min.pptx	3.4 MB
05_On_log_n_Algorithm_for_Closest_Pair_II_Advanced_-_Optional_19_min.pdf	4.1 MB
01_On_log_n_Algorithm_for_Counting_Inversions_I_13_min.mp4	13.5 MB
02_On_log_n_Algorithm_for_Counting_Inversions_II_17_min.mp4	18.0 MB
05_On_log_n_Algorithm_for_Closest_Pair_II_Advanced_-_Optional_19_min.mp4	21.1 MB
03_Strassens_Subcubic_Matrix_Multiplication_Algorithm_22_min.mp4	24.7 MB
04_On_log_n_Algorithm_for_Closest_Pair_I_Advanced_-_Optional_32_min.mp4	38.0 MB
/.../08_VIII._LINEAR-TIME_SELECTION_Week_3/
05_Deterministic_Selection_-_Analysis_II_Advanced_-_Optional_13_min.txt	14.3 KB
06_Omegan_log_n_Lower_Bound_for_Comparison-Based_Sorting_Advanced_-_Optional_13_min.txt	15.6 KB
03_Deterministic_Selection_-_Algorithm_Advanced_-_Optional_17_min.txt	19.4 KB
05_Deterministic_Selection_-_Analysis_II_Advanced_-_Optional_13_min.srt	20.9 KB
02_Randomized_Selection_-__Analysis_21_min.txt	21.9 KB
06_Omegan_log_n_Lower_Bound_for_Comparison-Based_Sorting_Advanced_-_Optional_13_min.srt	22.8 KB
04_Deterministic_Selection_-_Analysis_I_Advanced_-_Optional_22_min.txt	22.9 KB
01_Randomized_Selection_-_Algorithm_22_min.txt	24.9 KB
03_Deterministic_Selection_-_Algorithm_Advanced_-_Optional_17_min.srt	28.5 KB
02_Randomized_Selection_-__Analysis_21_min.srt	32.0 KB
04_Deterministic_Selection_-_Analysis_I_Advanced_-_Optional_22_min.srt	33.5 KB
01_Randomized_Selection_-_Algorithm_22_min.srt	36.4 KB
03_Deterministic_Selection_-_Algorithm_Advanced_-_Optional_17_min.pdf	94.8 KB
06_Omegan_log_n_Lower_Bound_for_Comparison-Based_Sorting_Advanced_-_Optional_13_min.pdf	276.5 KB
05_Deterministic_Selection_-_Analysis_II_Advanced_-_Optional_13_min.pdf	312.6 KB
06_Omegan_log_n_Lower_Bound_for_Comparison-Based_Sorting_Advanced_-_Optional_13_min_0_PDF.pdf	1.3 MB
05_Deterministic_Selection_-_Analysis_II_Advanced_-_Optional_13_min.pptx	1.5 MB
06_Omegan_log_n_Lower_Bound_for_Comparison-Based_Sorting_Advanced_-_Optional_13_min.pptx	1.6 MB
03_Deterministic_Selection_-_Algorithm_Advanced_-_Optional_17_min_1_TYPED.pdf	1.8 MB
03_Deterministic_Selection_-_Algorithm_Advanced_-_Optional_17_min.pptx	2.0 MB
01_Randomized_Selection_-_Algorithm_22_min.pdf	2.0 MB
02_Randomized_Selection_-__Analysis_21_min.pdf	2.1 MB
04_Deterministic_Selection_-_Analysis_I_Advanced_-_Optional_22_min.pdf	2.3 MB
04_Deterministic_Selection_-_Analysis_I_Advanced_-_Optional_22_min.pptx	2.4 MB
02_Randomized_Selection_-__Analysis_21_min_0_PDF.pdf	2.6 MB
01_Randomized_Selection_-_Algorithm_22_min_0_PDF.pdf	2.8 MB
02_Randomized_Selection_-__Analysis_21_min.pptx	2.9 MB
01_Randomized_Selection_-_Algorithm_22_min.pptx	3.1 MB
04_Deterministic_Selection_-_Analysis_I_Advanced_-_Optional_22_min_0_PDF.pdf	3.9 MB
03_Deterministic_Selection_-_Algorithm_Advanced_-_Optional_17_min_0_PDF.pdf	3.9 MB
05_Deterministic_Selection_-_Analysis_II_Advanced_-_Optional_13_min_0_PDF.pdf	4.7 MB
05_Deterministic_Selection_-_Analysis_II_Advanced_-_Optional_13_min.mp4	13.5 MB
06_Omegan_log_n_Lower_Bound_for_Comparison-Based_Sorting_Advanced_-_Optional_13_min.mp4	14.3 MB
03_Deterministic_Selection_-_Algorithm_Advanced_-_Optional_17_min.mp4	18.4 MB
02_Randomized_Selection_-__Analysis_21_min.mp4	21.6 MB
01_Randomized_Selection_-_Algorithm_22_min.mp4	22.4 MB
04_Deterministic_Selection_-_Analysis_I_Advanced_-_Optional_22_min.mp4	23.9 MB
/.../07_VII._PROBABILITY_REVIEW_Weeks_2-3/
02_Part_II_Review_-_Optional_17_min.txt	17.1 KB
02_Part_II_Review_-_Optional_17_min.srt	25.0 KB
01_Part_I_Review_-_Optional_25_min.txt	28.6 KB
01_Part_I_Review_-_Optional_25_min.srt	41.9 KB
02_Part_II_Review_-_Optional_17_min.pdf	1.3 MB
01_Part_I_Review_-_Optional_25_min.pdf	1.6 MB
02_Part_II_Review_-_Optional_17_min_0_PDF.pdf	2.5 MB
02_Part_II_Review_-_Optional_17_min.pptx	2.8 MB
01_Part_I_Review_-_Optional_25_min_0_PDF.pdf	3.5 MB
01_Part_I_Review_-_Optional_25_min.pptx	3.6 MB
02_Part_II_Review_-_Optional_17_min.mp4	18.1 MB
01_Part_I_Review_-_Optional_25_min.mp4	26.7 MB
/.../15_XV._UNIVERSAL_HASHING_Week_6/
04_Hash_Table_Performance_with_Open_Addressing_Advanced_-_Optional_16_min.txt	17.5 KB
03_Universal_Hashing-_Analysis_of_Chaining_Advanced_-_Optional_19_min.txt	19.9 KB
01_Pathological_Data_Sets_and_Universal_Hashing_Motivation_22_min.txt	24.6 KB
04_Hash_Table_Performance_with_Open_Addressing_Advanced_-_Optional_16_min.srt	25.6 KB
02_Universal_Hashing-_Definition_and_Example_Advanced_-_Optional_26_min.txt	27.6 KB
03_Universal_Hashing-_Analysis_of_Chaining_Advanced_-_Optional_19_min.srt	29.1 KB
01_Pathological_Data_Sets_and_Universal_Hashing_Motivation_22_min.srt	36.0 KB
02_Universal_Hashing-_Definition_and_Example_Advanced_-_Optional_26_min.srt	40.3 KB
01_Pathological_Data_Sets_and_Universal_Hashing_Motivation_22_min.pdf	125.1 KB
04_Hash_Table_Performance_with_Open_Addressing_Advanced_-_Optional_16_min.pdf	156.1 KB
03_Universal_Hashing-_Analysis_of_Chaining_Advanced_-_Optional_19_min.pdf	378.6 KB
02_Universal_Hashing-_Definition_and_Example_Advanced_-_Optional_26_min.pdf	790.4 KB
04_Hash_Table_Performance_with_Open_Addressing_Advanced_-_Optional_16_min.pptx	1.4 MB
04_Hash_Table_Performance_with_Open_Addressing_Advanced_-_Optional_16_min_0_PDF.pdf	1.5 MB
02_Universal_Hashing-_Definition_and_Example_Advanced_-_Optional_26_min_0_PDf.pdf	2.7 MB
02_Universal_Hashing-_Definition_and_Example_Advanced_-_Optional_26_min.pptx	3.1 MB
03_Universal_Hashing-_Analysis_of_Chaining_Advanced_-_Optional_19_min.pptx	3.3 MB
03_Universal_Hashing-_Analysis_of_Chaining_Advanced_-_Optional_19_min_0_PDF.pdf	3.5 MB
01_Pathological_Data_Sets_and_Universal_Hashing_Motivation_22_min_0_PDF.pdf	3.5 MB
01_Pathological_Data_Sets_and_Universal_Hashing_Motivation_22_min.pptx	3.8 MB
04_Hash_Table_Performance_with_Open_Addressing_Advanced_-_Optional_16_min.mp4	16.4 MB
03_Universal_Hashing-_Analysis_of_Chaining_Advanced_-_Optional_19_min.mp4	19.4 MB
01_Pathological_Data_Sets_and_Universal_Hashing_Motivation_22_min.mp4	23.6 MB
02_Universal_Hashing-_Definition_and_Example_Advanced_-_Optional_26_min.mp4	27.4 MB
/.../14_XIV._HASHING-_THE_BASICS_Week_6/
02_Hash_Tables-_Implementation_Details_Part_I_19_min.txt	22.1 KB
01_Hash_Tables-_Operations_and_Applications_19_min.txt	22.6 KB
03_Hash_Tables-_Implementation_Details_Part_II_22_min.txt	25.7 KB
02_Hash_Tables-_Implementation_Details_Part_I_19_min.srt	32.4 KB
01_Hash_Tables-_Operations_and_Applications_19_min.srt	33.0 KB
03_Hash_Tables-_Implementation_Details_Part_II_22_min.srt	37.6 KB
01_Hash_Tables-_Operations_and_Applications_19_min.pdf	229.0 KB
01_Hash_Tables-_Operations_and_Applications_19_min_0_PDF.pdf	1.7 MB
02_Hash_Tables-_Implementation_Details_Part_I_19_min.pdf	1.7 MB
03_Hash_Tables-_Implementation_Details_Part_II_22_min.pdf	1.7 MB
01_Hash_Tables-_Operations_and_Applications_19_min.pptx	1.9 MB
03_Hash_Tables-_Implementation_Details_Part_II_22_min_0_PDF.pdf	3.5 MB
02_Hash_Tables-_Implementation_Details_Part_I_19_min_0_PDF.pdf	3.5 MB
03_Hash_Tables-_Implementation_Details_Part_II_22_min.pptx	3.9 MB
02_Hash_Tables-_Implementation_Details_Part_I_19_min.pptx	3.9 MB
01_Hash_Tables-_Operations_and_Applications_19_min.mp4	20.7 MB
02_Hash_Tables-_Implementation_Details_Part_I_19_min.mp4	20.8 MB
03_Hash_Tables-_Implementation_Details_Part_II_22_min.mp4	23.6 MB
/Part 2/
assignment_home.html	31.5 KB
Final Exam.html	35.1 KB
course_home.html	63.6 KB
Assignments.html	100.5 KB
entered_login.html	1.4 MB
/Part 1/
assignment_home.html	33.4 KB
Final Exam.html	35.1 KB
Programming Questions.html	64.1 KB
Problem Sets.html	64.3 KB
course_home.html	82.4 KB
entered_login.html	1.4 MB
Total files 1116