589689.xyz

algo-005

  • 收录时间:2018-03-12 22:11:01
  • 文件大小:2GB
  • 下载次数:278
  • 最近下载:2021-01-22 20:01:49
  • 磁力链接:
立即下载 复制链接

文件列表

  1. ProgrammingQuestions/3_Programming_Question4/SCC.txt 69MB
  2. 03_III._DIVIDE__CONQUER_ALGORITHMS_Week_1/04_On_log_n_Algorithm_for_Closest_Pair_I_Advanced_-_Optional_32_min.mp4 36MB
  3. 13_XIII._BALANCED_BINARY_SEARCH_TREES_Week_5/03_Binary_Search_Tree_Basics_Part_II_30_min.mp4 30MB
  4. 09_IX._GRAPHS_AND_THE_CONTRACTION_ALGORITHM_Week_3/04_Analysis_of_Contraction_Algorithm_30_min.mp4 30MB
  5. 10_X._GRAPH_SEARCH_AND_CONNECTIVITY_Week_4/07_Computing_Strong_Components-_The_Algorithm_29_min.mp4 29MB
  6. 02_II._ASYMPTOTIC_ANALYSIS_Week_1/01_The_Gist_14_min.mp4 28MB
  7. 10_X._GRAPH_SEARCH_AND_CONNECTIVITY_Week_4/08_Computing_Strong_Components-_The_Analysis_26_min.mp4 27MB
  8. 11_XI._DIJKSTRAS_SHORTEST-PATH_ALGORITHM_Week_5/04_Dijkstras_Algorithm-_Implementation_and_Running_Time_26_min.mp4 26MB
  9. 15_XV._UNIVERSAL_HASHING_Week_6/02_Universal_Hashing-_Definition_and_Example_Advanced_-_Optional_26_min.mp4 26MB
  10. 07_VII._PROBABILITY_REVIEW_Weeks_2-3/01_Part_I_Review_-_Optional_25_min.mp4 25MB
  11. 05_V._QUICKSORT_-_ALGORITHM_Week_2/02_Partitioning_Around_a_Pivot_25_min.mp4 25MB
  12. 03_III._DIVIDE__CONQUER_ALGORITHMS_Week_1/03_Strassens_Subcubic_Matrix_Multiplication_Algorithm_22_min.mp4 24MB
  13. 10_X._GRAPH_SEARCH_AND_CONNECTIVITY_Week_4/01_Graph_Search_-_Overview_23_min.mp4 23MB
  14. 08_VIII._LINEAR-TIME_SELECTION_Week_3/04_Deterministic_Selection_-_Analysis_I_Advanced_-_Optional_22_min.mp4 23MB
  15. 14_XIV._HASHING-_THE_BASICS_Week_6/03_Hash_Tables-_Implementation_Details_Part_II_22_min.mp4 23MB
  16. 15_XV._UNIVERSAL_HASHING_Week_6/01_Pathological_Data_Sets_and_Universal_Hashing_Motivation_22_min.mp4 22MB
  17. 10_X._GRAPH_SEARCH_AND_CONNECTIVITY_Week_4/06_Topological_Sort_22_min.mp4 22MB
  18. 13_XIII._BALANCED_BINARY_SEARCH_TREES_Week_5/04_Red-Black_Trees_21_min.mp4 22MB
  19. 05_V._QUICKSORT_-_ALGORITHM_Week_2/04_Choosing_a_Good_Pivot_22min.mp4 22MB
  20. 01_I._INTRODUCTION_Week_1/03_Karatsuba_Multiplication_13_min.mp4 22MB
  21. 06_VI._QUICKSORT_-_ANALYSIS_Week_2/01_Analysis_I-_A_Decomposition_Principle__Advanced_-_Optional_22_min.mp4 22MB
  22. 08_VIII._LINEAR-TIME_SELECTION_Week_3/01_Randomized_Selection_-_Algorithm_22_min.mp4 21MB
  23. 11_XI._DIJKSTRAS_SHORTEST-PATH_ALGORITHM_Week_5/01_Dijkstras_Shortest-Path_Algorithm_21_min.mp4 21MB
  24. 12_XII._HEAPS_Week_5/03_Heaps-_Implementation_Details_Advanced_-_Optional_21_min.mp4 21MB
  25. 13_XIII._BALANCED_BINARY_SEARCH_TREES_Week_5/06_Insertion_in_a_Red-Black_Tree_Advanced_15_min.mp4 21MB
  26. 08_VIII._LINEAR-TIME_SELECTION_Week_3/02_Randomized_Selection_-__Analysis_21_min.mp4 21MB
  27. 11_XI._DIJKSTRAS_SHORTEST-PATH_ALGORITHM_Week_5/03_Correctness_of_Dijkstras_Algorithm_Advanced_-_Optional_19_min.mp4 20MB
  28. 03_III._DIVIDE__CONQUER_ALGORITHMS_Week_1/05_On_log_n_Algorithm_for_Closest_Pair_II_Advanced_-_Optional_19_min.mp4 20MB
  29. 14_XIV._HASHING-_THE_BASICS_Week_6/02_Hash_Tables-_Implementation_Details_Part_I_19_min.mp4 20MB
  30. 17_PREVIEW_OF_PART_2/07_Algorithmic_Approaches_to_NP-Complete_Problems_Optional_13_min.mp4 20MB
  31. 14_XIV._HASHING-_THE_BASICS_Week_6/01_Hash_Tables-_Operations_and_Applications_19_min.mp4 20MB
  32. 10_X._GRAPH_SEARCH_AND_CONNECTIVITY_Week_4/09_Structure_of_the_Web_Optional_19_min.mp4 19MB
  33. 12_XII._HEAPS_Week_5/02_Heaps-_Operations_and_Applications_18_min.mp4 19MB
  34. 15_XV._UNIVERSAL_HASHING_Week_6/03_Universal_Hashing-_Analysis_of_Chaining_Advanced_-_Optional_19_min.mp4 18MB
  35. 17_PREVIEW_OF_PART_2/03_Introduction_to_Greedy_Algorithms_Optional_13_min.mp4 18MB
  36. 01_I._INTRODUCTION_Week_1/08_Guiding_Principles_for_Analysis_of_Algorithms_15_min.mp4 18MB
  37. 08_VIII._LINEAR-TIME_SELECTION_Week_3/03_Deterministic_Selection_-_Algorithm_Advanced_-_Optional_17_min.mp4 18MB
  38. 01_I._INTRODUCTION_Week_1/04_About_the_Course_17_min.mp4 17MB
  39. 07_VII._PROBABILITY_REVIEW_Weeks_2-3/02_Part_II_Review_-_Optional_17_min.mp4 17MB
  40. 03_III._DIVIDE__CONQUER_ALGORITHMS_Week_1/02_On_log_n_Algorithm_for_Counting_Inversions_II_17_min.mp4 17MB
  41. 01_I._INTRODUCTION_Week_1/02_Integer_Multiplication_9_min.mp4 17MB
  42. 04_IV._THE_MASTER_METHOD_Week_2/06_Proof_II_16_min.mp4 17MB
  43. 09_IX._GRAPHS_AND_THE_CONTRACTION_ALGORITHM_Week_3/02_Graph_Representations_14_min.mp4 16MB
  44. 15_XV._UNIVERSAL_HASHING_Week_6/04_Hash_Table_Performance_with_Open_Addressing_Advanced_-_Optional_16_min.mp4 16MB
  45. 16_XV._BLOOM_FILTERS_Week_6/01_Bloom_Filters-_The_Basics_16_min.mp4 15MB
  46. 09_IX._GRAPHS_AND_THE_CONTRACTION_ALGORITHM_Week_3/01_Graphs_and_Minimum_Cuts_16_min.mp4 15MB
  47. 01_I._INTRODUCTION_Week_1/06_Merge_Sort-_Pseudocode_13_min.mp4 15MB
  48. 04_IV._THE_MASTER_METHOD_Week_2/03_Examples_13_min.mp4 14MB
  49. 17_PREVIEW_OF_PART_2/06_The_P_vs._NP_Question_Optional_9_min.mp4 14MB
  50. 10_X._GRAPH_SEARCH_AND_CONNECTIVITY_Week_4/02_Breadth-First_Search_BFS-_The_Basics_14_min.mp4 14MB
  51. 17_PREVIEW_OF_PART_2/01_Application-_Internet_Routing_Optional_11_min.mp4 14MB
  52. 10_X._GRAPH_SEARCH_AND_CONNECTIVITY_Week_4/04_BFS_and_Undirected_Connectivity_13_min.mp4 14MB
  53. 08_VIII._LINEAR-TIME_SELECTION_Week_3/06_Omegan_log_n_Lower_Bound_for_Comparison-Based_Sorting_Advanced_-_Optional_13_min.mp4 14MB
  54. 16_XV._BLOOM_FILTERS_Week_6/02_Bloom_Filters-_Heuristic_Analysis_13_min.mp4 14MB
  55. 13_XIII._BALANCED_BINARY_SEARCH_TREES_Week_5/02_Binary_Search_Tree_Basics_Part_I_13_min.mp4 13MB
  56. 04_IV._THE_MASTER_METHOD_Week_2/05_Interpretation_of_the_3_Cases_11_min.mp4 13MB
  57. 11_XI._DIJKSTRAS_SHORTEST-PATH_ALGORITHM_Week_5/02_Dijkstras_Algorithm-_Examples_13_min.mp4 13MB
  58. 03_III._DIVIDE__CONQUER_ALGORITHMS_Week_1/01_On_log_n_Algorithm_for_Counting_Inversions_I_13_min.mp4 13MB
  59. 08_VIII._LINEAR-TIME_SELECTION_Week_3/05_Deterministic_Selection_-_Analysis_II_Advanced_-_Optional_13_min.mp4 13MB
  60. 17_PREVIEW_OF_PART_2/05_Principles_of_Dynamic_Programming_Optional_8_min.mp4 12MB
  61. 05_V._QUICKSORT_-_ALGORITHM_Week_2/01_Quicksort-_Overview_12_min.mp4 12MB
  62. 06_VI._QUICKSORT_-_ANALYSIS_Week_2/02_Analysis_II-_The_Key_Insight_Advanced_-_Optional_12min.mp4 12MB
  63. 17_PREVIEW_OF_PART_2/04_Huffman_Codes-_Introduction_and_Motivation_Optional_9_min.mp4 12MB
  64. 05_V._QUICKSORT_-_ALGORITHM_Week_2/03_Correctness_of_Quicksort_Review_-_Optional_11_min.mp4 12MB
  65. ProgrammingQuestions/5_Programming_Question__6/algo1%2Fprogramming_prob%2F2sum.txt 12MB
  66. 04_IV._THE_MASTER_METHOD_Week_2/04_Proof_I_10_min.mp4 11MB
  67. 01_I._INTRODUCTION_Week_1/07_Merge_Sort-_Analysis_9_min.mp4 11MB
  68. 17_PREVIEW_OF_PART_2/02_Application-_Sequence_Alignment_Optional_9_min.mp4 11MB
  69. ProgrammingQuestions/3_Programming_Question4/SCC.zip 11MB
  70. 13_XIII._BALANCED_BINARY_SEARCH_TREES_Week_5/01_Balanced_Search_Trees-_Operations_and_Applications_11_min.mp4 11MB
  71. 01_I._INTRODUCTION_Week_1/05_Merge_Sort-_Motivation_and_Example_9_min.mp4 11MB
  72. 04_IV._THE_MASTER_METHOD_Week_2/02_Formal_Statement_10_min.mp4 10MB
  73. 13_XIII._BALANCED_BINARY_SEARCH_TREES_Week_5/05_Rotations_Advanced_-_Optional_8_min.mp4 10MB
  74. 06_VI._QUICKSORT_-_ANALYSIS_Week_2/03_Analysis_III-_Final_Calculations_Advanced_-_Optional_9min.mp4 9MB
  75. 09_IX._GRAPHS_AND_THE_CONTRACTION_ALGORITHM_Week_3/03_Random_Contraction_Algorithm_9_min.mp4 8MB
  76. 04_IV._THE_MASTER_METHOD_Week_2/01_Motivation_8_min.mp4 8MB
  77. 01_I._INTRODUCTION_Week_1/01_Why_Study_Algorithms__4_min.mp4 8MB
  78. 10_X._GRAPH_SEARCH_AND_CONNECTIVITY_Week_4/03_BFS_and_Shortest_Paths_8_min.mp4 8MB
  79. 02_II._ASYMPTOTIC_ANALYSIS_Week_1/05_Additional_Examples_Review_-_Optional_8_min.mp4 8MB
  80. 02_II._ASYMPTOTIC_ANALYSIS_Week_1/04_Big_Omega_and_Theta_7_min.mp4 7MB
  81. 09_IX._GRAPHS_AND_THE_CONTRACTION_ALGORITHM_Week_3/05_Counting_Minimum_Cuts_7_min.mp4 7MB
  82. 02_II._ASYMPTOTIC_ANALYSIS_Week_1/03_Basic_Examples_7_min.mp4 7MB
  83. 10_X._GRAPH_SEARCH_AND_CONNECTIVITY_Week_4/05_Depth-First_Search_DFS-_The_Basics_7_min.mp4 7MB
  84. 13_XIII._BALANCED_BINARY_SEARCH_TREES_Week_5/02_Binary_Search_Tree_Basics_Part_I_13_min.pptx 5MB
  85. 13_XIII._BALANCED_BINARY_SEARCH_TREES_Week_5/03_Binary_Search_Tree_Basics_Part_II_30_min.pptx 5MB
  86. 13_XIII._BALANCED_BINARY_SEARCH_TREES_Week_5/02_Binary_Search_Tree_Basics_Part_I_13_min_0_PDF.pdf 5MB
  87. 13_XIII._BALANCED_BINARY_SEARCH_TREES_Week_5/03_Binary_Search_Tree_Basics_Part_II_30_min_0_PDF.pdf 5MB
  88. 12_XII._HEAPS_Week_5/01_Data_Structures-_Overview_5_min.mp4 5MB
  89. 08_VIII._LINEAR-TIME_SELECTION_Week_3/05_Deterministic_Selection_-_Analysis_II_Advanced_-_Optional_13_min_0_PDF.pdf 5MB
  90. 02_II._ASYMPTOTIC_ANALYSIS_Week_1/02_Big-Oh_Notation_4_min.mp4 4MB
  91. 09_IX._GRAPHS_AND_THE_CONTRACTION_ALGORITHM_Week_3/04_Analysis_of_Contraction_Algorithm_30_min.pptx 4MB
  92. 03_III._DIVIDE__CONQUER_ALGORITHMS_Week_1/05_On_log_n_Algorithm_for_Closest_Pair_II_Advanced_-_Optional_19_min.pdf 4MB
  93. 05_V._QUICKSORT_-_ALGORITHM_Week_2/02_Partitioning_Around_a_Pivot_25_min.pdf 4MB
  94. 11_XI._DIJKSTRAS_SHORTEST-PATH_ALGORITHM_Week_5/04_Dijkstras_Algorithm-_Implementation_and_Running_Time_26_min.pptx 4MB
  95. 08_VIII._LINEAR-TIME_SELECTION_Week_3/03_Deterministic_Selection_-_Algorithm_Advanced_-_Optional_17_min_0_PDF.pdf 4MB
  96. 08_VIII._LINEAR-TIME_SELECTION_Week_3/04_Deterministic_Selection_-_Analysis_I_Advanced_-_Optional_22_min_0_PDF.pdf 4MB
  97. 14_XIV._HASHING-_THE_BASICS_Week_6/02_Hash_Tables-_Implementation_Details_Part_I_19_min.pptx 4MB
  98. 14_XIV._HASHING-_THE_BASICS_Week_6/03_Hash_Tables-_Implementation_Details_Part_II_22_min.pptx 4MB
  99. 15_XV._UNIVERSAL_HASHING_Week_6/01_Pathological_Data_Sets_and_Universal_Hashing_Motivation_22_min.pptx 4MB
  100. 09_IX._GRAPHS_AND_THE_CONTRACTION_ALGORITHM_Week_3/04_Analysis_of_Contraction_Algorithm_30_min_0_PDF.pdf 4MB
  101. 10_X._GRAPH_SEARCH_AND_CONNECTIVITY_Week_4/05_Depth-First_Search_DFS-_The_Basics_7_min.pptx 3MB
  102. 10_X._GRAPH_SEARCH_AND_CONNECTIVITY_Week_4/06_Topological_Sort_22_min.pptx 3MB
  103. 07_VII._PROBABILITY_REVIEW_Weeks_2-3/01_Part_I_Review_-_Optional_25_min.pptx 3MB
  104. 11_XI._DIJKSTRAS_SHORTEST-PATH_ALGORITHM_Week_5/04_Dijkstras_Algorithm-_Implementation_and_Running_Time_26_min_0_PDF.pdf 3MB
  105. 15_XV._UNIVERSAL_HASHING_Week_6/01_Pathological_Data_Sets_and_Universal_Hashing_Motivation_22_min_0_PDF.pdf 3MB
  106. 15_XV._UNIVERSAL_HASHING_Week_6/03_Universal_Hashing-_Analysis_of_Chaining_Advanced_-_Optional_19_min_0_PDF.pdf 3MB
  107. 07_VII._PROBABILITY_REVIEW_Weeks_2-3/01_Part_I_Review_-_Optional_25_min_0_PDF.pdf 3MB
  108. 14_XIV._HASHING-_THE_BASICS_Week_6/02_Hash_Tables-_Implementation_Details_Part_I_19_min_0_PDF.pdf 3MB
  109. 14_XIV._HASHING-_THE_BASICS_Week_6/03_Hash_Tables-_Implementation_Details_Part_II_22_min_0_PDF.pdf 3MB
  110. 03_III._DIVIDE__CONQUER_ALGORITHMS_Week_1/04_On_log_n_Algorithm_for_Closest_Pair_I_Advanced_-_Optional_32_min.pptx 3MB
  111. 15_XV._UNIVERSAL_HASHING_Week_6/03_Universal_Hashing-_Analysis_of_Chaining_Advanced_-_Optional_19_min.pptx 3MB
  112. 11_XI._DIJKSTRAS_SHORTEST-PATH_ALGORITHM_Week_5/03_Correctness_of_Dijkstras_Algorithm_Advanced_-_Optional_19_min.pptx 3MB
  113. 10_X._GRAPH_SEARCH_AND_CONNECTIVITY_Week_4/02_Breadth-First_Search_BFS-_The_Basics_14_min.pptx 3MB
  114. 10_X._GRAPH_SEARCH_AND_CONNECTIVITY_Week_4/03_BFS_and_Shortest_Paths_8_min.pptx 3MB
  115. 10_X._GRAPH_SEARCH_AND_CONNECTIVITY_Week_4/04_BFS_and_Undirected_Connectivity_13_min.pptx 3MB
  116. 10_X._GRAPH_SEARCH_AND_CONNECTIVITY_Week_4/05_Depth-First_Search_DFS-_The_Basics_7_min_0_PDF.pdf 3MB
  117. 10_X._GRAPH_SEARCH_AND_CONNECTIVITY_Week_4/06_Topological_Sort_22_min_0_PDF.pdf 3MB
  118. 03_III._DIVIDE__CONQUER_ALGORITHMS_Week_1/04_On_log_n_Algorithm_for_Closest_Pair_I_Advanced_-_Optional_32_min_0_PDF.pdf 3MB
  119. 11_XI._DIJKSTRAS_SHORTEST-PATH_ALGORITHM_Week_5/01_Dijkstras_Shortest-Path_Algorithm_21_min.pptx 3MB
  120. 11_XI._DIJKSTRAS_SHORTEST-PATH_ALGORITHM_Week_5/02_Dijkstras_Algorithm-_Examples_13_min.pptx 3MB
  121. 08_VIII._LINEAR-TIME_SELECTION_Week_3/01_Randomized_Selection_-_Algorithm_22_min.pptx 3MB
  122. 05_V._QUICKSORT_-_ALGORITHM_Week_2/02_Partitioning_Around_a_Pivot_25_min.pptx 3MB
  123. 15_XV._UNIVERSAL_HASHING_Week_6/02_Universal_Hashing-_Definition_and_Example_Advanced_-_Optional_26_min.pptx 3MB
  124. 10_X._GRAPH_SEARCH_AND_CONNECTIVITY_Week_4/08_Computing_Strong_Components-_The_Analysis_26_min.pptx 3MB
  125. 11_XI._DIJKSTRAS_SHORTEST-PATH_ALGORITHM_Week_5/03_Correctness_of_Dijkstras_Algorithm_Advanced_-_Optional_19_min_0_PDF.pdf 3MB
  126. 10_X._GRAPH_SEARCH_AND_CONNECTIVITY_Week_4/02_Breadth-First_Search_BFS-_The_Basics_14_min_0_PDF.pdf 3MB
  127. 10_X._GRAPH_SEARCH_AND_CONNECTIVITY_Week_4/03_BFS_and_Shortest_Paths_8_min_0_PDF.pdf 3MB
  128. 10_X._GRAPH_SEARCH_AND_CONNECTIVITY_Week_4/04_BFS_and_Undirected_Connectivity_13_min_0_PDF.pdf 3MB
  129. 10_X._GRAPH_SEARCH_AND_CONNECTIVITY_Week_4/07_Computing_Strong_Components-_The_Algorithm_29_min_0_PDF.pdf 3MB
  130. 08_VIII._LINEAR-TIME_SELECTION_Week_3/02_Randomized_Selection_-__Analysis_21_min.pptx 3MB
  131. 10_X._GRAPH_SEARCH_AND_CONNECTIVITY_Week_4/02_Breadth-First_Search_BFS-_The_Basics_14_min.pdf 3MB
  132. 10_X._GRAPH_SEARCH_AND_CONNECTIVITY_Week_4/03_BFS_and_Shortest_Paths_8_min.pdf 3MB
  133. 10_X._GRAPH_SEARCH_AND_CONNECTIVITY_Week_4/04_BFS_and_Undirected_Connectivity_13_min.pdf 3MB
  134. 11_XI._DIJKSTRAS_SHORTEST-PATH_ALGORITHM_Week_5/01_Dijkstras_Shortest-Path_Algorithm_21_min_0_PDF.pdf 3MB
  135. 11_XI._DIJKSTRAS_SHORTEST-PATH_ALGORITHM_Week_5/02_Dijkstras_Algorithm-_Examples_13_min_0_PDF.pdf 3MB
  136. 07_VII._PROBABILITY_REVIEW_Weeks_2-3/02_Part_II_Review_-_Optional_17_min.pptx 3MB
  137. 05_V._QUICKSORT_-_ALGORITHM_Week_2/02_Partitioning_Around_a_Pivot_25_min_0_PDF.pdf 3MB
  138. 08_VIII._LINEAR-TIME_SELECTION_Week_3/01_Randomized_Selection_-_Algorithm_22_min_0_PDF.pdf 3MB
  139. 10_X._GRAPH_SEARCH_AND_CONNECTIVITY_Week_4/01_Graph_Search_-_Overview_23_min.pptx 3MB
  140. 15_XV._UNIVERSAL_HASHING_Week_6/02_Universal_Hashing-_Definition_and_Example_Advanced_-_Optional_26_min_0_PDf.pdf 3MB
  141. 13_XIII._BALANCED_BINARY_SEARCH_TREES_Week_5/04_Red-Black_Trees_21_min.pptx 3MB
  142. 06_VI._QUICKSORT_-_ANALYSIS_Week_2/01_Analysis_I-_A_Decomposition_Principle__Advanced_-_Optional_22_min.pptx 3MB
  143. 10_X._GRAPH_SEARCH_AND_CONNECTIVITY_Week_4/08_Computing_Strong_Components-_The_Analysis_26_min_0_PDF.pdf 2MB
  144. 10_X._GRAPH_SEARCH_AND_CONNECTIVITY_Week_4/07_Computing_Strong_Components-_The_Algorithm_29_min.pptx 2MB
  145. 08_VIII._LINEAR-TIME_SELECTION_Week_3/02_Randomized_Selection_-__Analysis_21_min_0_PDF.pdf 2MB
  146. 16_XV._BLOOM_FILTERS_Week_6/01_Bloom_Filters-_The_Basics_16_min_0_PDF.pdf 2MB
  147. 16_XV._BLOOM_FILTERS_Week_6/02_Bloom_Filters-_Heuristic_Analysis_13_min_0_PDF.pdf 2MB
  148. 12_XII._HEAPS_Week_5/02_Heaps-_Operations_and_Applications_18_min.pptx 2MB
  149. 16_XV._BLOOM_FILTERS_Week_6/01_Bloom_Filters-_The_Basics_16_min.pptx 2MB
  150. 16_XV._BLOOM_FILTERS_Week_6/02_Bloom_Filters-_Heuristic_Analysis_13_min.pptx 2MB
  151. 12_XII._HEAPS_Week_5/03_Heaps-_Implementation_Details_Advanced_-_Optional_21_min.pptx 2MB
  152. 07_VII._PROBABILITY_REVIEW_Weeks_2-3/02_Part_II_Review_-_Optional_17_min_0_PDF.pdf 2MB
  153. 08_VIII._LINEAR-TIME_SELECTION_Week_3/04_Deterministic_Selection_-_Analysis_I_Advanced_-_Optional_22_min.pptx 2MB
  154. 13_XIII._BALANCED_BINARY_SEARCH_TREES_Week_5/04_Red-Black_Trees_21_min_0_PDF.pdf 2MB
  155. 10_X._GRAPH_SEARCH_AND_CONNECTIVITY_Week_4/01_Graph_Search_-_Overview_23_min_0_PDF.pdf 2MB
  156. 02_II._ASYMPTOTIC_ANALYSIS_Week_1/01_The_Gist_14_min_0_PDF.pdf 2MB
  157. 03_III._DIVIDE__CONQUER_ALGORITHMS_Week_1/02_On_log_n_Algorithm_for_Counting_Inversions_II_17_min.pptx 2MB
  158. 03_III._DIVIDE__CONQUER_ALGORITHMS_Week_1/05_On_log_n_Algorithm_for_Closest_Pair_II_Advanced_-_Optional_19_min.pptx 2MB
  159. 08_VIII._LINEAR-TIME_SELECTION_Week_3/04_Deterministic_Selection_-_Analysis_I_Advanced_-_Optional_22_min.pdf 2MB
  160. 06_VI._QUICKSORT_-_ANALYSIS_Week_2/01_Analysis_I-_A_Decomposition_Principle__Advanced_-_Optional_22_min_0_PDF.pdf 2MB
  161. 12_XII._HEAPS_Week_5/02_Heaps-_Operations_and_Applications_18_min_0_PDF.pdf 2MB
  162. 17_PREVIEW_OF_PART_2/02_Application-_Sequence_Alignment_Optional_9_min.pdf 2MB
  163. 10_X._GRAPH_SEARCH_AND_CONNECTIVITY_Week_4/05_Depth-First_Search_DFS-_The_Basics_7_min.pdf 2MB
  164. 10_X._GRAPH_SEARCH_AND_CONNECTIVITY_Week_4/06_Topological_Sort_22_min.pdf 2MB
  165. 03_III._DIVIDE__CONQUER_ALGORITHMS_Week_1/04_On_log_n_Algorithm_for_Closest_Pair_I_Advanced_-_Optional_32_min.pdf 2MB
  166. 12_XII._HEAPS_Week_5/03_Heaps-_Implementation_Details_Advanced_-_Optional_21_min_0_PDF.pdf 2MB
  167. 08_VIII._LINEAR-TIME_SELECTION_Week_3/02_Randomized_Selection_-__Analysis_21_min.pdf 2MB
  168. 03_III._DIVIDE__CONQUER_ALGORITHMS_Week_1/03_Strassens_Subcubic_Matrix_Multiplication_Algorithm_22_min.pptx 2MB
  169. 03_III._DIVIDE__CONQUER_ALGORITHMS_Week_1/05_On_log_n_Algorithm_for_Closest_Pair_II_Advanced_-_Optional_19_min_0_PDF.pdf 2MB
  170. 06_VI._QUICKSORT_-_ANALYSIS_Week_2/02_Analysis_II-_The_Key_Insight_Advanced_-_Optional_12min.pptx 2MB
  171. 10_X._GRAPH_SEARCH_AND_CONNECTIVITY_Week_4/01_Graph_Search_-_Overview_23_min.pdf 2MB
  172. 10_X._GRAPH_SEARCH_AND_CONNECTIVITY_Week_4/09_Structure_of_the_Web_Optional_19_min.pptx 2MB
  173. 03_III._DIVIDE__CONQUER_ALGORITHMS_Week_1/02_On_log_n_Algorithm_for_Counting_Inversions_II_17_min_0_PDF.pdf 2MB
  174. 09_IX._GRAPHS_AND_THE_CONTRACTION_ALGORITHM_Week_3/01_Graphs_and_Minimum_Cuts_16_min.pptx 2MB
  175. 08_VIII._LINEAR-TIME_SELECTION_Week_3/01_Randomized_Selection_-_Algorithm_22_min.pdf 2MB
  176. 08_VIII._LINEAR-TIME_SELECTION_Week_3/03_Deterministic_Selection_-_Algorithm_Advanced_-_Optional_17_min.pptx 2MB
  177. 05_V._QUICKSORT_-_ALGORITHM_Week_2/04_Choosing_a_Good_Pivot_22min.pptx 2MB
  178. 09_IX._GRAPHS_AND_THE_CONTRACTION_ALGORITHM_Week_3/02_Graph_Representations_14_min.pptx 2MB
  179. 03_III._DIVIDE__CONQUER_ALGORITHMS_Week_1/03_Strassens_Subcubic_Matrix_Multiplication_Algorithm_22_min.pdf 2MB
  180. 14_XIV._HASHING-_THE_BASICS_Week_6/01_Hash_Tables-_Operations_and_Applications_19_min.pptx 2MB
  181. 09_IX._GRAPHS_AND_THE_CONTRACTION_ALGORITHM_Week_3/02_Graph_Representations_14_min_0_PDF.pdf 2MB
  182. 03_III._DIVIDE__CONQUER_ALGORITHMS_Week_1/03_Strassens_Subcubic_Matrix_Multiplication_Algorithm_22_min_0_PDF.pdf 2MB
  183. 10_X._GRAPH_SEARCH_AND_CONNECTIVITY_Week_4/09_Structure_of_the_Web_Optional_19_min_0_PDF.pdf 2MB
  184. 17_PREVIEW_OF_PART_2/03_Introduction_to_Greedy_Algorithms_Optional_13_min.pdf 2MB
  185. 05_V._QUICKSORT_-_ALGORITHM_Week_2/03_Correctness_of_Quicksort_Review_-_Optional_11_min.pptx 2MB
  186. 09_IX._GRAPHS_AND_THE_CONTRACTION_ALGORITHM_Week_3/01_Graphs_and_Minimum_Cuts_16_min_0_PDF.pdf 2MB
  187. 06_VI._QUICKSORT_-_ANALYSIS_Week_2/02_Analysis_II-_The_Key_Insight_Advanced_-_Optional_12min_0_PDF.pdf 2MB
  188. 08_VIII._LINEAR-TIME_SELECTION_Week_3/03_Deterministic_Selection_-_Algorithm_Advanced_-_Optional_17_min_1_TYPED.pdf 2MB
  189. 17_PREVIEW_OF_PART_2/04_Huffman_Codes-_Introduction_and_Motivation_Optional_9_min.pdf 2MB
  190. 14_XIV._HASHING-_THE_BASICS_Week_6/02_Hash_Tables-_Implementation_Details_Part_I_19_min.pdf 2MB
  191. 14_XIV._HASHING-_THE_BASICS_Week_6/03_Hash_Tables-_Implementation_Details_Part_II_22_min.pdf 2MB
  192. 01_I._INTRODUCTION_Week_1/08_Guiding_Principles_for_Analysis_of_Algorithms_15_min.pptx 2MB
  193. 05_V._QUICKSORT_-_ALGORITHM_Week_2/04_Choosing_a_Good_Pivot_22min_0_PDF.pdf 2MB
  194. 04_IV._THE_MASTER_METHOD_Week_2/06_Proof_II_16_min.pptx 2MB
  195. 14_XIV._HASHING-_THE_BASICS_Week_6/01_Hash_Tables-_Operations_and_Applications_19_min_0_PDF.pdf 2MB
  196. 08_VIII._LINEAR-TIME_SELECTION_Week_3/06_Omegan_log_n_Lower_Bound_for_Comparison-Based_Sorting_Advanced_-_Optional_13_min.pptx 2MB
  197. 04_IV._THE_MASTER_METHOD_Week_2/01_Motivation_8_min.pptx 2MB
  198. 07_VII._PROBABILITY_REVIEW_Weeks_2-3/01_Part_I_Review_-_Optional_25_min.pdf 2MB
  199. 10_X._GRAPH_SEARCH_AND_CONNECTIVITY_Week_4/07_Computing_Strong_Components-_The_Algorithm_29_min_1_TYPED.pdf 2MB
  200. 13_XIII._BALANCED_BINARY_SEARCH_TREES_Week_5/06_Insertion_in_a_Red-Black_Tree_Advanced_15_min_0_PDF.pdf 1MB
  201. 03_III._DIVIDE__CONQUER_ALGORITHMS_Week_1/01_On_log_n_Algorithm_for_Counting_Inversions_I_13_min.pptx 1MB
  202. 05_V._QUICKSORT_-_ALGORITHM_Week_2/04_Choosing_a_Good_Pivot_22min.pdf 1MB
  203. 05_V._QUICKSORT_-_ALGORITHM_Week_2/03_Correctness_of_Quicksort_Review_-_Optional_11_min_0_PDF.pdf 1MB
  204. 04_IV._THE_MASTER_METHOD_Week_2/01_Motivation_8_min_0_PDF.pdf 1MB
  205. 15_XV._UNIVERSAL_HASHING_Week_6/04_Hash_Table_Performance_with_Open_Addressing_Advanced_-_Optional_16_min_0_PDF.pdf 1MB
  206. 04_IV._THE_MASTER_METHOD_Week_2/06_Proof_II_16_min_0_PDF.pdf 1MB
  207. 17_PREVIEW_OF_PART_2/01_Application-_Internet_Routing_Optional_11_min.pdf 1MB
  208. 08_VIII._LINEAR-TIME_SELECTION_Week_3/05_Deterministic_Selection_-_Analysis_II_Advanced_-_Optional_13_min.pptx 1MB
  209. 01_I._INTRODUCTION_Week_1/08_Guiding_Principles_for_Analysis_of_Algorithms_15_min_0_PDF.pdf 1MB
  210. 06_VI._QUICKSORT_-_ANALYSIS_Week_2/01_Analysis_I-_A_Decomposition_Principle__Advanced_-_Optional_22_min.pdf 1MB
  211. 09_IX._GRAPHS_AND_THE_CONTRACTION_ALGORITHM_Week_3/03_Random_Contraction_Algorithm_9_min.pptx 1MB
  212. 05_V._QUICKSORT_-_ALGORITHM_Week_2/01_Quicksort-_Overview_12_min.pptx 1MB
  213. 04_IV._THE_MASTER_METHOD_Week_2/04_Proof_I_10_min.pptx 1MB
  214. 15_XV._UNIVERSAL_HASHING_Week_6/04_Hash_Table_Performance_with_Open_Addressing_Advanced_-_Optional_16_min.pptx 1MB
  215. entered_login.html 1MB
  216. 05_V._QUICKSORT_-_ALGORITHM_Week_2/01_Quicksort-_Overview_12_min.pdf 1MB
  217. 06_VI._QUICKSORT_-_ANALYSIS_Week_2/03_Analysis_III-_Final_Calculations_Advanced_-_Optional_9min.pptx 1MB
  218. 17_PREVIEW_OF_PART_2/06_The_P_vs._NP_Question_Optional_9_min.pdf 1MB
  219. 01_I._INTRODUCTION_Week_1/06_Merge_Sort-_Pseudocode_13_min.pptx 1MB
  220. 02_II._ASYMPTOTIC_ANALYSIS_Week_1/05_Additional_Examples_Review_-_Optional_8_min.pptx 1MB
  221. 03_III._DIVIDE__CONQUER_ALGORITHMS_Week_1/01_On_log_n_Algorithm_for_Counting_Inversions_I_13_min_0_PDF.pdf 1MB
  222. 09_IX._GRAPHS_AND_THE_CONTRACTION_ALGORITHM_Week_3/05_Counting_Minimum_Cuts_7_min.pptx 1MB
  223. 04_IV._THE_MASTER_METHOD_Week_2/04_Proof_I_10_min_0_PDF.pdf 1MB
  224. 08_VIII._LINEAR-TIME_SELECTION_Week_3/06_Omegan_log_n_Lower_Bound_for_Comparison-Based_Sorting_Advanced_-_Optional_13_min_0_PDF.pdf 1MB
  225. 01_I._INTRODUCTION_Week_1/03_Karatsuba_Multiplication_13_min_0_PDF.pdf 1MB
  226. 04_IV._THE_MASTER_METHOD_Week_2/03_Examples_13_min.pptx 1MB
  227. 13_XIII._BALANCED_BINARY_SEARCH_TREES_Week_5/01_Balanced_Search_Trees-_Operations_and_Applications_11_min.pptx 1MB
  228. 07_VII._PROBABILITY_REVIEW_Weeks_2-3/02_Part_II_Review_-_Optional_17_min.pdf 1MB
  229. 09_IX._GRAPHS_AND_THE_CONTRACTION_ALGORITHM_Week_3/03_Random_Contraction_Algorithm_9_min_0_PDF.pdf 1MB
  230. 05_V._QUICKSORT_-_ALGORITHM_Week_2/01_Quicksort-_Overview_12_min_0_PDF.pdf 1MB
  231. 17_PREVIEW_OF_PART_2/07_Algorithmic_Approaches_to_NP-Complete_Problems_Optional_13_min.pdf 1MB
  232. 01_I._INTRODUCTION_Week_1/07_Merge_Sort-_Analysis_9_min.pptx 1MB
  233. 01_I._INTRODUCTION_Week_1/06_Merge_Sort-_Pseudocode_13_min_0_PDF.pdf 1MB
  234. 02_II._ASYMPTOTIC_ANALYSIS_Week_1/04_Big_Omega_and_Theta_7_min.pptx 1MB
  235. 12_XII._HEAPS_Week_5/01_Data_Structures-_Overview_5_min.pptx 1MB
  236. 02_II._ASYMPTOTIC_ANALYSIS_Week_1/05_Additional_Examples_Review_-_Optional_8_min_0_PDF.pdf 1MB
  237. 04_IV._THE_MASTER_METHOD_Week_2/02_Formal_Statement_10_min.pptx 1MB
  238. 05_V._QUICKSORT_-_ALGORITHM_Week_2/03_Correctness_of_Quicksort_Review_-_Optional_11_min.pdf 1MB
  239. 12_XII._HEAPS_Week_5/03_Heaps-_Implementation_Details_Advanced_-_Optional_21_min.pdf 1MB
  240. 06_VI._QUICKSORT_-_ANALYSIS_Week_2/03_Analysis_III-_Final_Calculations_Advanced_-_Optional_9min_0_PDF.pdf 1MB
  241. 04_IV._THE_MASTER_METHOD_Week_2/03_Examples_13_min_0_PDF.pdf 1MB
  242. 09_IX._GRAPHS_AND_THE_CONTRACTION_ALGORITHM_Week_3/05_Counting_Minimum_Cuts_7_min_0_PDF.pdf 1MB
  243. 06_VI._QUICKSORT_-_ANALYSIS_Week_2/03_Analysis_III-_Final_Calculations_Advanced_-_Optional_9min_1_TYPED.pdf 999KB
  244. 02_II._ASYMPTOTIC_ANALYSIS_Week_1/04_Big_Omega_and_Theta_7_min.pdf 990KB
  245. 13_XIII._BALANCED_BINARY_SEARCH_TREES_Week_5/01_Balanced_Search_Trees-_Operations_and_Applications_11_min_0_PDF.pdf 981KB
  246. 04_IV._THE_MASTER_METHOD_Week_2/04_Proof_I_10_min.pdf 944KB
  247. 01_I._INTRODUCTION_Week_1/07_Merge_Sort-_Analysis_9_min_0_PDF.pdf 931KB
  248. 03_III._DIVIDE__CONQUER_ALGORITHMS_Week_1/01_On_log_n_Algorithm_for_Counting_Inversions_I_13_min.pdf 915KB
  249. 04_IV._THE_MASTER_METHOD_Week_2/05_Interpretation_of_the_3_Cases_11_min.pptx 881KB
  250. 02_II._ASYMPTOTIC_ANALYSIS_Week_1/02_Big-Oh_Notation_4_min.pptx 869KB
  251. 13_XIII._BALANCED_BINARY_SEARCH_TREES_Week_5/05_Rotations_Advanced_-_Optional_8_min_0_PDF.pdf 869KB
  252. 02_II._ASYMPTOTIC_ANALYSIS_Week_1/04_Big_Omega_and_Theta_7_min_0_PDF.pdf 869KB
  253. 04_IV._THE_MASTER_METHOD_Week_2/02_Formal_Statement_10_min_0_PDF.pdf 867KB
  254. 17_PREVIEW_OF_PART_2/05_Principles_of_Dynamic_Programming_Optional_8_min.pdf 862KB
  255. 02_II._ASYMPTOTIC_ANALYSIS_Week_1/03_Basic_Examples_7_min.pptx 860KB
  256. 04_IV._THE_MASTER_METHOD_Week_2/03_Examples_13_min.pdf 855KB
  257. 12_XII._HEAPS_Week_5/01_Data_Structures-_Overview_5_min_0_PDF.pdf 844KB
  258. 04_IV._THE_MASTER_METHOD_Week_2/06_Proof_II_16_min.pdf 826KB
  259. 02_II._ASYMPTOTIC_ANALYSIS_Week_1/05_Additional_Examples_Review_-_Optional_8_min.pdf 822KB
  260. 02_II._ASYMPTOTIC_ANALYSIS_Week_1/02_Big-Oh_Notation_4_min.pdf 812KB
  261. 01_I._INTRODUCTION_Week_1/05_Merge_Sort-_Motivation_and_Example_9_min.pptx 796KB
  262. 01_I._INTRODUCTION_Week_1/02_Integer_Multiplication_9_min_0_PDF.pdf 791KB
  263. 15_XV._UNIVERSAL_HASHING_Week_6/02_Universal_Hashing-_Definition_and_Example_Advanced_-_Optional_26_min.pdf 772KB
  264. 01_I._INTRODUCTION_Week_1/04_About_the_Course_17_min.pdf 731KB
  265. 01_I._INTRODUCTION_Week_1/07_Merge_Sort-_Analysis_9_min.pdf 721KB
  266. 01_I._INTRODUCTION_Week_1/05_Merge_Sort-_Motivation_and_Example_9_min.pdf 697KB
  267. 01_I._INTRODUCTION_Week_1/03_Karatsuba_Multiplication_13_min.pdf 677KB
  268. ProgrammingQuestions/0_Programming_Question1/IntegerArray.txt 673KB
  269. 01_I._INTRODUCTION_Week_1/06_Merge_Sort-_Pseudocode_13_min.pdf 664KB
  270. 02_II._ASYMPTOTIC_ANALYSIS_Week_1/02_Big-Oh_Notation_4_min_0_PDF.pdf 660KB
  271. 02_II._ASYMPTOTIC_ANALYSIS_Week_1/03_Basic_Examples_7_min_0_PDF.pdf 659KB
  272. 04_IV._THE_MASTER_METHOD_Week_2/05_Interpretation_of_the_3_Cases_11_min_0_PDF.pdf 636KB
  273. 01_I._INTRODUCTION_Week_1/05_Merge_Sort-_Motivation_and_Example_9_min_0_PDF.pdf 633KB
  274. 09_IX._GRAPHS_AND_THE_CONTRACTION_ALGORITHM_Week_3/03_Random_Contraction_Algorithm_9_min.pdf 627KB
  275. 09_IX._GRAPHS_AND_THE_CONTRACTION_ALGORITHM_Week_3/04_Analysis_of_Contraction_Algorithm_30_min.pdf 613KB
  276. 01_I._INTRODUCTION_Week_1/02_Integer_Multiplication_9_min.pdf 611KB
  277. 01_I._INTRODUCTION_Week_1/08_Guiding_Principles_for_Analysis_of_Algorithms_15_min.pdf 554KB
  278. 09_IX._GRAPHS_AND_THE_CONTRACTION_ALGORITHM_Week_3/01_Graphs_and_Minimum_Cuts_16_min.pdf 497KB
  279. 10_X._GRAPH_SEARCH_AND_CONNECTIVITY_Week_4/08_Computing_Strong_Components-_The_Analysis_26_min.pdf 462KB
  280. 09_IX._GRAPHS_AND_THE_CONTRACTION_ALGORITHM_Week_3/02_Graph_Representations_14_min.pdf 461KB
  281. 13_XIII._BALANCED_BINARY_SEARCH_TREES_Week_5/02_Binary_Search_Tree_Basics_Part_I_13_min.pdf 458KB
  282. 13_XIII._BALANCED_BINARY_SEARCH_TREES_Week_5/03_Binary_Search_Tree_Basics_Part_II_30_min.pdf 458KB
  283. 04_IV._THE_MASTER_METHOD_Week_2/01_Motivation_8_min.pdf 457KB
  284. 03_III._DIVIDE__CONQUER_ALGORITHMS_Week_1/02_On_log_n_Algorithm_for_Counting_Inversions_II_17_min.pdf 452KB
  285. 01_I._INTRODUCTION_Week_1/04_About_the_Course_17_min.pptx 447KB
  286. 11_XI._DIJKSTRAS_SHORTEST-PATH_ALGORITHM_Week_5/04_Dijkstras_Algorithm-_Implementation_and_Running_Time_26_min.pdf 443KB
  287. 11_XI._DIJKSTRAS_SHORTEST-PATH_ALGORITHM_Week_5/03_Correctness_of_Dijkstras_Algorithm_Advanced_-_Optional_19_min.pdf 434KB
  288. 11_XI._DIJKSTRAS_SHORTEST-PATH_ALGORITHM_Week_5/01_Dijkstras_Shortest-Path_Algorithm_21_min.pdf 433KB
  289. 11_XI._DIJKSTRAS_SHORTEST-PATH_ALGORITHM_Week_5/02_Dijkstras_Algorithm-_Examples_13_min.pdf 433KB
  290. 15_XV._UNIVERSAL_HASHING_Week_6/03_Universal_Hashing-_Analysis_of_Chaining_Advanced_-_Optional_19_min.pdf 370KB
  291. 04_IV._THE_MASTER_METHOD_Week_2/02_Formal_Statement_10_min.pdf 362KB
  292. 02_II._ASYMPTOTIC_ANALYSIS_Week_1/03_Basic_Examples_7_min.pdf 338KB
  293. 08_VIII._LINEAR-TIME_SELECTION_Week_3/05_Deterministic_Selection_-_Analysis_II_Advanced_-_Optional_13_min.pdf 305KB
  294. 06_VI._QUICKSORT_-_ANALYSIS_Week_2/02_Analysis_II-_The_Key_Insight_Advanced_-_Optional_12min.pdf 301KB
  295. 01_I._INTRODUCTION_Week_1/01_Why_Study_Algorithms__4_min.pptx 282KB
  296. 09_IX._GRAPHS_AND_THE_CONTRACTION_ALGORITHM_Week_3/05_Counting_Minimum_Cuts_7_min.pdf 280KB
  297. 04_IV._THE_MASTER_METHOD_Week_2/05_Interpretation_of_the_3_Cases_11_min.pdf 277KB
  298. 02_II._ASYMPTOTIC_ANALYSIS_Week_1/01_The_Gist_14_min.pdf 273KB
  299. 08_VIII._LINEAR-TIME_SELECTION_Week_3/06_Omegan_log_n_Lower_Bound_for_Comparison-Based_Sorting_Advanced_-_Optional_13_min.pdf 270KB
  300. 01_I._INTRODUCTION_Week_1/04_About_the_Course_17_min_0_PDF.pdf 260KB
  301. 13_XIII._BALANCED_BINARY_SEARCH_TREES_Week_5/04_Red-Black_Trees_21_min.pdf 247KB
  302. 10_X._GRAPH_SEARCH_AND_CONNECTIVITY_Week_4/09_Structure_of_the_Web_Optional_19_min.pdf 245KB
  303. 14_XIV._HASHING-_THE_BASICS_Week_6/01_Hash_Tables-_Operations_and_Applications_19_min.pdf 224KB
  304. 12_XII._HEAPS_Week_5/02_Heaps-_Operations_and_Applications_18_min.pdf 221KB
  305. 01_I._INTRODUCTION_Week_1/01_Why_Study_Algorithms__4_min.pdf 216KB
  306. 01_I._INTRODUCTION_Week_1/01_Why_Study_Algorithms__4_min_0_PDF.pdf 216KB
  307. 12_XII._HEAPS_Week_5/01_Data_Structures-_Overview_5_min.pdf 193KB
  308. 16_XV._BLOOM_FILTERS_Week_6/01_Bloom_Filters-_The_Basics_16_min.pdf 186KB
  309. 16_XV._BLOOM_FILTERS_Week_6/02_Bloom_Filters-_Heuristic_Analysis_13_min.pdf 186KB
  310. 15_XV._UNIVERSAL_HASHING_Week_6/04_Hash_Table_Performance_with_Open_Addressing_Advanced_-_Optional_16_min.pdf 152KB
  311. 13_XIII._BALANCED_BINARY_SEARCH_TREES_Week_5/01_Balanced_Search_Trees-_Operations_and_Applications_11_min.pdf 123KB
  312. 15_XV._UNIVERSAL_HASHING_Week_6/01_Pathological_Data_Sets_and_Universal_Hashing_Motivation_22_min.pdf 122KB
  313. 13_XIII._BALANCED_BINARY_SEARCH_TREES_Week_5/06_Insertion_in_a_Red-Black_Tree_Advanced_15_min.pdf 109KB
  314. ProblemSets/0_Problem_Set1/0_Problem_Set1.html 106KB
  315. 13_XIII._BALANCED_BINARY_SEARCH_TREES_Week_5/05_Rotations_Advanced_-_Optional_8_min.pdf 101KB
  316. ProblemSets/3_Problem_Set4/3_Problem_Set4.html 100KB
  317. TheoryProblems/TheoryProblems.html 95KB
  318. 08_VIII._LINEAR-TIME_SELECTION_Week_3/03_Deterministic_Selection_-_Algorithm_Advanced_-_Optional_17_min.pdf 93KB
  319. 10_X._GRAPH_SEARCH_AND_CONNECTIVITY_Week_4/07_Computing_Strong_Components-_The_Algorithm_29_min.pdf 92KB
  320. ProblemSets/4_Problem_Set5/4_Problem_Set5.html 86KB
  321. 06_VI._QUICKSORT_-_ANALYSIS_Week_2/03_Analysis_III-_Final_Calculations_Advanced_-_Optional_9min.pdf 84KB
  322. course_home.html 80KB
  323. Home/Home.html 80KB
  324. ProgrammingQuestions/5_Programming_Question__6/5_Programming_Question__6.html 76KB
  325. ProgrammingQuestions/5_Programming_Question__6/zip_page.html 76KB
  326. ProblemSets/5_Problem_Set6/5_Problem_Set6.html 75KB
  327. Problem Sets.html 63KB
  328. Programming Questions.html 63KB
  329. DiscussionForums/DiscussionForums.html 60KB
  330. ProgrammingQuestions/1_Programming_Question__2/QuickSort.txt 58KB
  331. ProgrammingQuestions/5_Programming_Question__6/Median.txt 58KB
  332. ProgrammingQuestions/1_Programming_Question__2/1_Programming_Question__2.html 57KB
  333. ProgrammingQuestions/1_Programming_Question__2/zip_page.html 57KB
  334. ProblemSets/2_Problem_Set3/2_Problem_Set3.html 54KB
  335. ProblemSets/1_Problem_Set2/1_Problem_Set2.html 53KB
  336. 03_III._DIVIDE__CONQUER_ALGORITHMS_Week_1/04_On_log_n_Algorithm_for_Closest_Pair_I_Advanced_-_Optional_32_min.srt 52KB
  337. ProgrammingQuestions/0_Programming_Question1/0_Programming_Question1.html 48KB
  338. ProgrammingQuestions/0_Programming_Question1/zip_page.html 48KB
  339. 13_XIII._BALANCED_BINARY_SEARCH_TREES_Week_5/03_Binary_Search_Tree_Basics_Part_II_30_min.srt 48KB
  340. ProgrammingQuestions/3_Programming_Question4/3_Programming_Question4.html 46KB
  341. ProgrammingQuestions/3_Programming_Question4/zip_page.html 46KB
  342. 10_X._GRAPH_SEARCH_AND_CONNECTIVITY_Week_4/07_Computing_Strong_Components-_The_Algorithm_29_min.srt 46KB
  343. ProgrammingQuestions/4_Programming_Question5/zip_page.html 45KB
  344. ProgrammingQuestions/2_Programming_Question__3/2_Programming_Question__3.html 45KB
  345. ProgrammingQuestions/2_Programming_Question__3/zip_page.html 45KB
  346. ProgrammingQuestions/4_Programming_Question5/4_Programming_Question5.html 45KB
  347. 09_IX._GRAPHS_AND_THE_CONTRACTION_ALGORITHM_Week_3/04_Analysis_of_Contraction_Algorithm_30_min.srt 43KB
  348. 07_VII._PROBABILITY_REVIEW_Weeks_2-3/01_Part_I_Review_-_Optional_25_min.srt 41KB
  349. 11_XI._DIJKSTRAS_SHORTEST-PATH_ALGORITHM_Week_5/04_Dijkstras_Algorithm-_Implementation_and_Running_Time_26_min.srt 41KB
  350. 10_X._GRAPH_SEARCH_AND_CONNECTIVITY_Week_4/08_Computing_Strong_Components-_The_Analysis_26_min.srt 40KB
  351. 15_XV._UNIVERSAL_HASHING_Week_6/02_Universal_Hashing-_Definition_and_Example_Advanced_-_Optional_26_min.srt 39KB
  352. 10_X._GRAPH_SEARCH_AND_CONNECTIVITY_Week_4/01_Graph_Search_-_Overview_23_min.srt 38KB
  353. Syllabus/Syllabus.html 38KB
  354. 05_V._QUICKSORT_-_ALGORITHM_Week_2/02_Partitioning_Around_a_Pivot_25_min.srt 37KB
  355. 14_XIV._HASHING-_THE_BASICS_Week_6/03_Hash_Tables-_Implementation_Details_Part_II_22_min.srt 37KB
  356. 03_III._DIVIDE__CONQUER_ALGORITHMS_Week_1/04_On_log_n_Algorithm_for_Closest_Pair_I_Advanced_-_Optional_32_min.txt 36KB
  357. 08_VIII._LINEAR-TIME_SELECTION_Week_3/01_Randomized_Selection_-_Algorithm_22_min.srt 36KB
  358. CourseLogistics/CourseLogistics.html 35KB
  359. 13_XIII._BALANCED_BINARY_SEARCH_TREES_Week_5/04_Red-Black_Trees_21_min.srt 35KB
  360. 15_XV._UNIVERSAL_HASHING_Week_6/01_Pathological_Data_Sets_and_Universal_Hashing_Motivation_22_min.srt 35KB
  361. 05_V._QUICKSORT_-_ALGORITHM_Week_2/04_Choosing_a_Good_Pivot_22min.srt 35KB
  362. Final Exam.html 34KB
  363. 06_VI._QUICKSORT_-_ANALYSIS_Week_2/01_Analysis_I-_A_Decomposition_Principle__Advanced_-_Optional_22_min.srt 33KB
  364. 10_X._GRAPH_SEARCH_AND_CONNECTIVITY_Week_4/06_Topological_Sort_22_min.srt 33KB
  365. 12_XII._HEAPS_Week_5/03_Heaps-_Implementation_Details_Advanced_-_Optional_21_min.srt 33KB
  366. 08_VIII._LINEAR-TIME_SELECTION_Week_3/04_Deterministic_Selection_-_Analysis_I_Advanced_-_Optional_22_min.srt 33KB
  367. assignment_home.html 33KB
  368. 13_XIII._BALANCED_BINARY_SEARCH_TREES_Week_5/03_Binary_Search_Tree_Basics_Part_II_30_min.txt 32KB
  369. 14_XIV._HASHING-_THE_BASICS_Week_6/01_Hash_Tables-_Operations_and_Applications_19_min.srt 32KB
  370. 11_XI._DIJKSTRAS_SHORTEST-PATH_ALGORITHM_Week_5/01_Dijkstras_Shortest-Path_Algorithm_21_min.srt 32KB
  371. 14_XIV._HASHING-_THE_BASICS_Week_6/02_Hash_Tables-_Implementation_Details_Part_I_19_min.srt 32KB
  372. 10_X._GRAPH_SEARCH_AND_CONNECTIVITY_Week_4/07_Computing_Strong_Components-_The_Algorithm_29_min.txt 32KB
  373. FinalExam/0_Final_Exam/0_Final_Exam.html 32KB
  374. ProgrammingQuestions/4_Programming_Question5/dijkstraData.txt 31KB
  375. 03_III._DIVIDE__CONQUER_ALGORITHMS_Week_1/03_Strassens_Subcubic_Matrix_Multiplication_Algorithm_22_min.srt 31KB
  376. 08_VIII._LINEAR-TIME_SELECTION_Week_3/02_Randomized_Selection_-__Analysis_21_min.srt 31KB
  377. 01_I._INTRODUCTION_Week_1/04_About_the_Course_17_min.srt 30KB
  378. 10_X._GRAPH_SEARCH_AND_CONNECTIVITY_Week_4/09_Structure_of_the_Web_Optional_19_min.srt 29KB
  379. 03_III._DIVIDE__CONQUER_ALGORITHMS_Week_1/05_On_log_n_Algorithm_for_Closest_Pair_II_Advanced_-_Optional_19_min.srt 29KB
  380. 09_IX._GRAPHS_AND_THE_CONTRACTION_ALGORITHM_Week_3/04_Analysis_of_Contraction_Algorithm_30_min.txt 29KB
  381. 12_XII._HEAPS_Week_5/02_Heaps-_Operations_and_Applications_18_min.srt 29KB
  382. 15_XV._UNIVERSAL_HASHING_Week_6/03_Universal_Hashing-_Analysis_of_Chaining_Advanced_-_Optional_19_min.srt 28KB
  383. 07_VII._PROBABILITY_REVIEW_Weeks_2-3/01_Part_I_Review_-_Optional_25_min.txt 28KB
  384. 08_VIII._LINEAR-TIME_SELECTION_Week_3/03_Deterministic_Selection_-_Algorithm_Advanced_-_Optional_17_min.srt 28KB
  385. 11_XI._DIJKSTRAS_SHORTEST-PATH_ALGORITHM_Week_5/04_Dijkstras_Algorithm-_Implementation_and_Running_Time_26_min.txt 28KB
  386. 11_XI._DIJKSTRAS_SHORTEST-PATH_ALGORITHM_Week_5/03_Correctness_of_Dijkstras_Algorithm_Advanced_-_Optional_19_min.srt 27KB
  387. 03_III._DIVIDE__CONQUER_ALGORITHMS_Week_1/02_On_log_n_Algorithm_for_Counting_Inversions_II_17_min.srt 27KB
  388. 15_XV._UNIVERSAL_HASHING_Week_6/02_Universal_Hashing-_Definition_and_Example_Advanced_-_Optional_26_min.txt 27KB
  389. 10_X._GRAPH_SEARCH_AND_CONNECTIVITY_Week_4/08_Computing_Strong_Components-_The_Analysis_26_min.txt 27KB
  390. 16_XV._BLOOM_FILTERS_Week_6/01_Bloom_Filters-_The_Basics_16_min.srt 26KB
  391. 10_X._GRAPH_SEARCH_AND_CONNECTIVITY_Week_4/01_Graph_Search_-_Overview_23_min.txt 26KB
  392. 14_XIV._HASHING-_THE_BASICS_Week_6/03_Hash_Tables-_Implementation_Details_Part_II_22_min.txt 25KB
  393. 05_V._QUICKSORT_-_ALGORITHM_Week_2/02_Partitioning_Around_a_Pivot_25_min.txt 25KB
  394. 15_XV._UNIVERSAL_HASHING_Week_6/04_Hash_Table_Performance_with_Open_Addressing_Advanced_-_Optional_16_min.srt 25KB
  395. 01_I._INTRODUCTION_Week_1/08_Guiding_Principles_for_Analysis_of_Algorithms_15_min.srt 24KB
  396. 04_IV._THE_MASTER_METHOD_Week_2/06_Proof_II_16_min.srt 24KB
  397. 07_VII._PROBABILITY_REVIEW_Weeks_2-3/02_Part_II_Review_-_Optional_17_min.srt 24KB
  398. 08_VIII._LINEAR-TIME_SELECTION_Week_3/01_Randomized_Selection_-_Algorithm_22_min.txt 24KB
  399. 15_XV._UNIVERSAL_HASHING_Week_6/01_Pathological_Data_Sets_and_Universal_Hashing_Motivation_22_min.txt 24KB
  400. 05_V._QUICKSORT_-_ALGORITHM_Week_2/04_Choosing_a_Good_Pivot_22min.txt 24KB
  401. 09_IX._GRAPHS_AND_THE_CONTRACTION_ALGORITHM_Week_3/01_Graphs_and_Minimum_Cuts_16_min.srt 24KB
  402. 13_XIII._BALANCED_BINARY_SEARCH_TREES_Week_5/04_Red-Black_Trees_21_min.txt 23KB
  403. 06_VI._QUICKSORT_-_ANALYSIS_Week_2/01_Analysis_I-_A_Decomposition_Principle__Advanced_-_Optional_22_min.txt 23KB
  404. 10_X._GRAPH_SEARCH_AND_CONNECTIVITY_Week_4/06_Topological_Sort_22_min.txt 23KB
  405. 12_XII._HEAPS_Week_5/03_Heaps-_Implementation_Details_Advanced_-_Optional_21_min.txt 22KB
  406. 08_VIII._LINEAR-TIME_SELECTION_Week_3/04_Deterministic_Selection_-_Analysis_I_Advanced_-_Optional_22_min.txt 22KB
  407. 08_VIII._LINEAR-TIME_SELECTION_Week_3/06_Omegan_log_n_Lower_Bound_for_Comparison-Based_Sorting_Advanced_-_Optional_13_min.srt 22KB
  408. 10_X._GRAPH_SEARCH_AND_CONNECTIVITY_Week_4/02_Breadth-First_Search_BFS-_The_Basics_14_min.srt 22KB
  409. 10_X._GRAPH_SEARCH_AND_CONNECTIVITY_Week_4/04_BFS_and_Undirected_Connectivity_13_min.srt 22KB
  410. 14_XIV._HASHING-_THE_BASICS_Week_6/01_Hash_Tables-_Operations_and_Applications_19_min.txt 22KB
  411. 11_XI._DIJKSTRAS_SHORTEST-PATH_ALGORITHM_Week_5/01_Dijkstras_Shortest-Path_Algorithm_21_min.txt 22KB
  412. 17_PREVIEW_OF_PART_2/03_Introduction_to_Greedy_Algorithms_Optional_13_min.srt 22KB
  413. 09_IX._GRAPHS_AND_THE_CONTRACTION_ALGORITHM_Week_3/02_Graph_Representations_14_min.srt 22KB
  414. 14_XIV._HASHING-_THE_BASICS_Week_6/02_Hash_Tables-_Implementation_Details_Part_I_19_min.txt 22KB
  415. 03_III._DIVIDE__CONQUER_ALGORITHMS_Week_1/03_Strassens_Subcubic_Matrix_Multiplication_Algorithm_22_min.txt 21KB
  416. 08_VIII._LINEAR-TIME_SELECTION_Week_3/02_Randomized_Selection_-__Analysis_21_min.txt 21KB
  417. 13_XIII._BALANCED_BINARY_SEARCH_TREES_Week_5/06_Insertion_in_a_Red-Black_Tree_Advanced_15_min.srt 21KB
  418. 02_II._ASYMPTOTIC_ANALYSIS_Week_1/01_The_Gist_14_min.srt 21KB
  419. 13_XIII._BALANCED_BINARY_SEARCH_TREES_Week_5/02_Binary_Search_Tree_Basics_Part_I_13_min.srt 21KB
  420. 01_I._INTRODUCTION_Week_1/04_About_the_Course_17_min.txt 21KB
  421. 17_PREVIEW_OF_PART_2/07_Algorithmic_Approaches_to_NP-Complete_Problems_Optional_13_min.srt 21KB
  422. 08_VIII._LINEAR-TIME_SELECTION_Week_3/05_Deterministic_Selection_-_Analysis_II_Advanced_-_Optional_13_min.srt 20KB
  423. 01_I._INTRODUCTION_Week_1/06_Merge_Sort-_Pseudocode_13_min.srt 20KB
  424. 03_III._DIVIDE__CONQUER_ALGORITHMS_Week_1/01_On_log_n_Algorithm_for_Counting_Inversions_I_13_min.srt 20KB
  425. 10_X._GRAPH_SEARCH_AND_CONNECTIVITY_Week_4/09_Structure_of_the_Web_Optional_19_min.txt 20KB
  426. 16_XV._BLOOM_FILTERS_Week_6/02_Bloom_Filters-_Heuristic_Analysis_13_min.srt 20KB
  427. 03_III._DIVIDE__CONQUER_ALGORITHMS_Week_1/05_On_log_n_Algorithm_for_Closest_Pair_II_Advanced_-_Optional_19_min.txt 20KB
  428. 12_XII._HEAPS_Week_5/02_Heaps-_Operations_and_Applications_18_min.txt 20KB
  429. 15_XV._UNIVERSAL_HASHING_Week_6/03_Universal_Hashing-_Analysis_of_Chaining_Advanced_-_Optional_19_min.txt 19KB
  430. 04_IV._THE_MASTER_METHOD_Week_2/03_Examples_13_min.srt 19KB
  431. 08_VIII._LINEAR-TIME_SELECTION_Week_3/03_Deterministic_Selection_-_Algorithm_Advanced_-_Optional_17_min.txt 19KB
  432. 11_XI._DIJKSTRAS_SHORTEST-PATH_ALGORITHM_Week_5/02_Dijkstras_Algorithm-_Examples_13_min.srt 19KB
  433. 11_XI._DIJKSTRAS_SHORTEST-PATH_ALGORITHM_Week_5/03_Correctness_of_Dijkstras_Algorithm_Advanced_-_Optional_19_min.txt 19KB
  434. 03_III._DIVIDE__CONQUER_ALGORITHMS_Week_1/02_On_log_n_Algorithm_for_Counting_Inversions_II_17_min.txt 19KB
  435. ProgrammingQuestions/2_Programming_Question__3/kargerMinCut.txt 18KB
  436. 16_XV._BLOOM_FILTERS_Week_6/01_Bloom_Filters-_The_Basics_16_min.txt 18KB
  437. 17_PREVIEW_OF_PART_2/01_Application-_Internet_Routing_Optional_11_min.srt 18KB
  438. 05_V._QUICKSORT_-_ALGORITHM_Week_2/01_Quicksort-_Overview_12_min.srt 18KB
  439. 06_VI._QUICKSORT_-_ANALYSIS_Week_2/02_Analysis_II-_The_Key_Insight_Advanced_-_Optional_12min.srt 17KB
  440. 04_IV._THE_MASTER_METHOD_Week_2/05_Interpretation_of_the_3_Cases_11_min.srt 17KB
  441. 15_XV._UNIVERSAL_HASHING_Week_6/04_Hash_Table_Performance_with_Open_Addressing_Advanced_-_Optional_16_min.txt 17KB
  442. 01_I._INTRODUCTION_Week_1/03_Karatsuba_Multiplication_13_min.srt 17KB
  443. 13_XIII._BALANCED_BINARY_SEARCH_TREES_Week_5/01_Balanced_Search_Trees-_Operations_and_Applications_11_min.srt 17KB
  444. 04_IV._THE_MASTER_METHOD_Week_2/06_Proof_II_16_min.txt 17KB
  445. 01_I._INTRODUCTION_Week_1/08_Guiding_Principles_for_Analysis_of_Algorithms_15_min.txt 17KB
  446. 07_VII._PROBABILITY_REVIEW_Weeks_2-3/02_Part_II_Review_-_Optional_17_min.txt 17KB
  447. 09_IX._GRAPHS_AND_THE_CONTRACTION_ALGORITHM_Week_3/01_Graphs_and_Minimum_Cuts_16_min.txt 16KB
  448. 04_IV._THE_MASTER_METHOD_Week_2/04_Proof_I_10_min.srt 15KB
  449. 08_VIII._LINEAR-TIME_SELECTION_Week_3/06_Omegan_log_n_Lower_Bound_for_Comparison-Based_Sorting_Advanced_-_Optional_13_min.txt 15KB
  450. 10_X._GRAPH_SEARCH_AND_CONNECTIVITY_Week_4/02_Breadth-First_Search_BFS-_The_Basics_14_min.txt 15KB
  451. 09_IX._GRAPHS_AND_THE_CONTRACTION_ALGORITHM_Week_3/02_Graph_Representations_14_min.txt 15KB
  452. 10_X._GRAPH_SEARCH_AND_CONNECTIVITY_Week_4/04_BFS_and_Undirected_Connectivity_13_min.txt 15KB
  453. 17_PREVIEW_OF_PART_2/03_Introduction_to_Greedy_Algorithms_Optional_13_min.txt 15KB
  454. 04_IV._THE_MASTER_METHOD_Week_2/02_Formal_Statement_10_min.srt 14KB
  455. 13_XIII._BALANCED_BINARY_SEARCH_TREES_Week_5/02_Binary_Search_Tree_Basics_Part_I_13_min.txt 14KB
  456. 13_XIII._BALANCED_BINARY_SEARCH_TREES_Week_5/06_Insertion_in_a_Red-Black_Tree_Advanced_15_min.txt 14KB
  457. 17_PREVIEW_OF_PART_2/04_Huffman_Codes-_Introduction_and_Motivation_Optional_9_min.srt 14KB
  458. 02_II._ASYMPTOTIC_ANALYSIS_Week_1/01_The_Gist_14_min.txt 14KB
  459. 08_VIII._LINEAR-TIME_SELECTION_Week_3/05_Deterministic_Selection_-_Analysis_II_Advanced_-_Optional_13_min.txt 14KB
  460. 05_V._QUICKSORT_-_ALGORITHM_Week_2/03_Correctness_of_Quicksort_Review_-_Optional_11_min.srt 14KB
  461. 01_I._INTRODUCTION_Week_1/06_Merge_Sort-_Pseudocode_13_min.txt 14KB
  462. 01_I._INTRODUCTION_Week_1/07_Merge_Sort-_Analysis_9_min.srt 14KB
  463. 03_III._DIVIDE__CONQUER_ALGORITHMS_Week_1/01_On_log_n_Algorithm_for_Counting_Inversions_I_13_min.txt 14KB
  464. 17_PREVIEW_OF_PART_2/07_Algorithmic_Approaches_to_NP-Complete_Problems_Optional_13_min.txt 14KB
  465. 16_XV._BLOOM_FILTERS_Week_6/02_Bloom_Filters-_Heuristic_Analysis_13_min.txt 14KB
  466. 09_IX._GRAPHS_AND_THE_CONTRACTION_ALGORITHM_Week_3/03_Random_Contraction_Algorithm_9_min.srt 14KB
  467. 17_PREVIEW_OF_PART_2/06_The_P_vs._NP_Question_Optional_9_min.srt 13KB
  468. 01_I._INTRODUCTION_Week_1/05_Merge_Sort-_Motivation_and_Example_9_min.srt 13KB
  469. 04_IV._THE_MASTER_METHOD_Week_2/03_Examples_13_min.txt 13KB
  470. 17_PREVIEW_OF_PART_2/02_Application-_Sequence_Alignment_Optional_9_min.srt 13KB
  471. 11_XI._DIJKSTRAS_SHORTEST-PATH_ALGORITHM_Week_5/02_Dijkstras_Algorithm-_Examples_13_min.txt 13KB
  472. 17_PREVIEW_OF_PART_2/05_Principles_of_Dynamic_Programming_Optional_8_min.srt 12KB
  473. 04_IV._THE_MASTER_METHOD_Week_2/01_Motivation_8_min.srt 12KB
  474. 10_X._GRAPH_SEARCH_AND_CONNECTIVITY_Week_4/05_Depth-First_Search_DFS-_The_Basics_7_min.srt 12KB
  475. 05_V._QUICKSORT_-_ALGORITHM_Week_2/01_Quicksort-_Overview_12_min.txt 12KB
  476. 06_VI._QUICKSORT_-_ANALYSIS_Week_2/03_Analysis_III-_Final_Calculations_Advanced_-_Optional_9min.srt 12KB
  477. 02_II._ASYMPTOTIC_ANALYSIS_Week_1/05_Additional_Examples_Review_-_Optional_8_min.srt 12KB
  478. 17_PREVIEW_OF_PART_2/01_Application-_Internet_Routing_Optional_11_min.txt 12KB
  479. 10_X._GRAPH_SEARCH_AND_CONNECTIVITY_Week_4/03_BFS_and_Shortest_Paths_8_min.srt 12KB
  480. 04_IV._THE_MASTER_METHOD_Week_2/05_Interpretation_of_the_3_Cases_11_min.txt 12KB
  481. 02_II._ASYMPTOTIC_ANALYSIS_Week_1/04_Big_Omega_and_Theta_7_min.srt 12KB
  482. 13_XIII._BALANCED_BINARY_SEARCH_TREES_Week_5/01_Balanced_Search_Trees-_Operations_and_Applications_11_min.txt 12KB
  483. 01_I._INTRODUCTION_Week_1/03_Karatsuba_Multiplication_13_min.txt 11KB
  484. 02_II._ASYMPTOTIC_ANALYSIS_Week_1/03_Basic_Examples_7_min.srt 11KB
  485. 01_I._INTRODUCTION_Week_1/02_Integer_Multiplication_9_min.srt 11KB
  486. 06_VI._QUICKSORT_-_ANALYSIS_Week_2/02_Analysis_II-_The_Key_Insight_Advanced_-_Optional_12min.txt 11KB
  487. 04_IV._THE_MASTER_METHOD_Week_2/04_Proof_I_10_min.txt 11KB
  488. 13_XIII._BALANCED_BINARY_SEARCH_TREES_Week_5/05_Rotations_Advanced_-_Optional_8_min.srt 10KB
  489. 01_I._INTRODUCTION_Week_1/05_Merge_Sort-_Motivation_and_Example_9_min.txt 10KB
  490. 04_IV._THE_MASTER_METHOD_Week_2/02_Formal_Statement_10_min.txt 10KB
  491. 05_V._QUICKSORT_-_ALGORITHM_Week_2/03_Correctness_of_Quicksort_Review_-_Optional_11_min.txt 10KB
  492. 09_IX._GRAPHS_AND_THE_CONTRACTION_ALGORITHM_Week_3/05_Counting_Minimum_Cuts_7_min.srt 10KB
  493. 01_I._INTRODUCTION_Week_1/07_Merge_Sort-_Analysis_9_min.txt 9KB
  494. 17_PREVIEW_OF_PART_2/04_Huffman_Codes-_Introduction_and_Motivation_Optional_9_min.txt 9KB
  495. 09_IX._GRAPHS_AND_THE_CONTRACTION_ALGORITHM_Week_3/03_Random_Contraction_Algorithm_9_min.txt 9KB
  496. 17_PREVIEW_OF_PART_2/06_The_P_vs._NP_Question_Optional_9_min.txt 9KB
  497. 17_PREVIEW_OF_PART_2/02_Application-_Sequence_Alignment_Optional_9_min.txt 9KB
  498. 10_X._GRAPH_SEARCH_AND_CONNECTIVITY_Week_4/05_Depth-First_Search_DFS-_The_Basics_7_min.txt 8KB
  499. 04_IV._THE_MASTER_METHOD_Week_2/01_Motivation_8_min.txt 8KB
  500. 06_VI._QUICKSORT_-_ANALYSIS_Week_2/03_Analysis_III-_Final_Calculations_Advanced_-_Optional_9min.txt 8KB
  501. 02_II._ASYMPTOTIC_ANALYSIS_Week_1/05_Additional_Examples_Review_-_Optional_8_min.txt 8KB
  502. 17_PREVIEW_OF_PART_2/05_Principles_of_Dynamic_Programming_Optional_8_min.txt 8KB
  503. 10_X._GRAPH_SEARCH_AND_CONNECTIVITY_Week_4/03_BFS_and_Shortest_Paths_8_min.txt 8KB
  504. 02_II._ASYMPTOTIC_ANALYSIS_Week_1/04_Big_Omega_and_Theta_7_min.txt 8KB
  505. 02_II._ASYMPTOTIC_ANALYSIS_Week_1/03_Basic_Examples_7_min.txt 8KB
  506. 01_I._INTRODUCTION_Week_1/02_Integer_Multiplication_9_min.txt 7KB
  507. 12_XII._HEAPS_Week_5/01_Data_Structures-_Overview_5_min.srt 7KB
  508. 13_XIII._BALANCED_BINARY_SEARCH_TREES_Week_5/05_Rotations_Advanced_-_Optional_8_min.txt 7KB
  509. 09_IX._GRAPHS_AND_THE_CONTRACTION_ALGORITHM_Week_3/05_Counting_Minimum_Cuts_7_min.txt 7KB
  510. 02_II._ASYMPTOTIC_ANALYSIS_Week_1/02_Big-Oh_Notation_4_min.srt 6KB
  511. 01_I._INTRODUCTION_Week_1/01_Why_Study_Algorithms__4_min.srt 6KB
  512. 12_XII._HEAPS_Week_5/01_Data_Structures-_Overview_5_min.txt 5KB
  513. 02_II._ASYMPTOTIC_ANALYSIS_Week_1/02_Big-Oh_Notation_4_min.txt 4KB
  514. 01_I._INTRODUCTION_Week_1/01_Why_Study_Algorithms__4_min.txt 4KB
  515. DiscussionForums/links.txt 3KB
  516. Home/links.txt 2KB
  517. ProgrammingQuestions/5_Programming_Question__6/links.txt 2KB
  518. ProgrammingQuestions/3_Programming_Question4/links.txt 2KB
  519. ProgrammingQuestions/0_Programming_Question1/links.txt 2KB
  520. ProgrammingQuestions/2_Programming_Question__3/links.txt 2KB
  521. ProgrammingQuestions/4_Programming_Question5/links.txt 2KB
  522. ProgrammingQuestions/1_Programming_Question__2/links.txt 2KB
  523. FinalExam/0_Final_Exam/links.txt 2KB
  524. ProblemSets/0_Problem_Set1/links.txt 2KB
  525. ProblemSets/4_Problem_Set5/links.txt 2KB
  526. ProblemSets/1_Problem_Set2/links.txt 2KB
  527. ProblemSets/2_Problem_Set3/links.txt 2KB
  528. ProblemSets/3_Problem_Set4/links.txt 2KB
  529. ProblemSets/5_Problem_Set6/links.txt 2KB
  530. CourseLogistics/links.txt 2KB
  531. TheoryProblems/links.txt 2KB
  532. Syllabus/links.txt 2KB