algo-005

1. 01_I._INTRODUCTION_Week_1/01_Why_Study_Algorithms__4_min.mp47.98MB
2. 01_I._INTRODUCTION_Week_1/02_Integer_Multiplication_9_min.mp416.86MB
3. 01_I._INTRODUCTION_Week_1/03_Karatsuba_Multiplication_13_min.mp421.66MB
4. 01_I._INTRODUCTION_Week_1/04_About_the_Course_17_min.mp417.37MB
5. 01_I._INTRODUCTION_Week_1/05_Merge_Sort-_Motivation_and_Example_9_min.mp410.68MB
6. 01_I._INTRODUCTION_Week_1/06_Merge_Sort-_Pseudocode_13_min.mp415.01MB
7. 01_I._INTRODUCTION_Week_1/07_Merge_Sort-_Analysis_9_min.mp411.31MB
8. 01_I._INTRODUCTION_Week_1/08_Guiding_Principles_for_Analysis_of_Algorithms_15_min.mp417.99MB
9. 02_II._ASYMPTOTIC_ANALYSIS_Week_1/01_The_Gist_14_min.mp427.68MB
10. 02_II._ASYMPTOTIC_ANALYSIS_Week_1/02_Big-Oh_Notation_4_min.mp44.13MB
11. 02_II._ASYMPTOTIC_ANALYSIS_Week_1/03_Basic_Examples_7_min.mp47.3MB
12. 02_II._ASYMPTOTIC_ANALYSIS_Week_1/04_Big_Omega_and_Theta_7_min.mp47.49MB
13. 02_II._ASYMPTOTIC_ANALYSIS_Week_1/05_Additional_Examples_Review_-_Optional_8_min.mp47.72MB
14. 03_III._DIVIDE__CONQUER_ALGORITHMS_Week_1/01_On_log_n_Algorithm_for_Counting_Inversions_I_13_min.mp412.85MB
15. 03_III._DIVIDE__CONQUER_ALGORITHMS_Week_1/02_On_log_n_Algorithm_for_Counting_Inversions_II_17_min.mp417.19MB
16. 03_III._DIVIDE__CONQUER_ALGORITHMS_Week_1/03_Strassens_Subcubic_Matrix_Multiplication_Algorithm_22_min.mp423.57MB
17. 03_III._DIVIDE__CONQUER_ALGORITHMS_Week_1/04_On_log_n_Algorithm_for_Closest_Pair_I_Advanced_-_Optional_32_min.mp436.22MB
18. 03_III._DIVIDE__CONQUER_ALGORITHMS_Week_1/05_On_log_n_Algorithm_for_Closest_Pair_II_Advanced_-_Optional_19_min.mp420.14MB
19. 04_IV._THE_MASTER_METHOD_Week_2/01_Motivation_8_min.mp48.25MB
20. 04_IV._THE_MASTER_METHOD_Week_2/02_Formal_Statement_10_min.mp410.42MB
21. 04_IV._THE_MASTER_METHOD_Week_2/03_Examples_13_min.mp414.4MB
22. 04_IV._THE_MASTER_METHOD_Week_2/04_Proof_I_10_min.mp411.46MB
23. 04_IV._THE_MASTER_METHOD_Week_2/05_Interpretation_of_the_3_Cases_11_min.mp413.11MB
24. 04_IV._THE_MASTER_METHOD_Week_2/06_Proof_II_16_min.mp416.6MB
25. 05_V._QUICKSORT_-_ALGORITHM_Week_2/01_Quicksort-_Overview_12_min.mp412.19MB
26. 05_V._QUICKSORT_-_ALGORITHM_Week_2/02_Partitioning_Around_a_Pivot_25_min.mp424.84MB
27. 05_V._QUICKSORT_-_ALGORITHM_Week_2/03_Correctness_of_Quicksort_Review_-_Optional_11_min.mp411.82MB
28. 05_V._QUICKSORT_-_ALGORITHM_Week_2/04_Choosing_a_Good_Pivot_22min.mp421.74MB
29. 06_VI._QUICKSORT_-_ANALYSIS_Week_2/01_Analysis_I-_A_Decomposition_Principle__Advanced_-_Optional_22_min.mp421.65MB
30. 06_VI._QUICKSORT_-_ANALYSIS_Week_2/02_Analysis_II-_The_Key_Insight_Advanced_-_Optional_12min.mp411.98MB
31. 06_VI._QUICKSORT_-_ANALYSIS_Week_2/03_Analysis_III-_Final_Calculations_Advanced_-_Optional_9min.mp48.92MB
32. 07_VII._PROBABILITY_REVIEW_Weeks_2-3/01_Part_I_Review_-_Optional_25_min.mp425.42MB
33. 07_VII._PROBABILITY_REVIEW_Weeks_2-3/02_Part_II_Review_-_Optional_17_min.mp417.26MB
34. 08_VIII._LINEAR-TIME_SELECTION_Week_3/01_Randomized_Selection_-_Algorithm_22_min.mp421.4MB
35. 08_VIII._LINEAR-TIME_SELECTION_Week_3/02_Randomized_Selection_-__Analysis_21_min.mp420.62MB
36. 08_VIII._LINEAR-TIME_SELECTION_Week_3/03_Deterministic_Selection_-_Algorithm_Advanced_-_Optional_17_min.mp417.55MB
37. 08_VIII._LINEAR-TIME_SELECTION_Week_3/04_Deterministic_Selection_-_Analysis_I_Advanced_-_Optional_22_min.mp422.82MB
38. 08_VIII._LINEAR-TIME_SELECTION_Week_3/05_Deterministic_Selection_-_Analysis_II_Advanced_-_Optional_13_min.mp412.83MB
39. 08_VIII._LINEAR-TIME_SELECTION_Week_3/06_Omegan_log_n_Lower_Bound_for_Comparison-Based_Sorting_Advanced_-_Optional_13_min.mp413.68MB
40. 09_IX._GRAPHS_AND_THE_CONTRACTION_ALGORITHM_Week_3/01_Graphs_and_Minimum_Cuts_16_min.mp415.21MB
41. 09_IX._GRAPHS_AND_THE_CONTRACTION_ALGORITHM_Week_3/02_Graph_Representations_14_min.mp415.69MB
42. 09_IX._GRAPHS_AND_THE_CONTRACTION_ALGORITHM_Week_3/03_Random_Contraction_Algorithm_9_min.mp48.28MB
43. 09_IX._GRAPHS_AND_THE_CONTRACTION_ALGORITHM_Week_3/04_Analysis_of_Contraction_Algorithm_30_min.mp429.87MB
44. 09_IX._GRAPHS_AND_THE_CONTRACTION_ALGORITHM_Week_3/05_Counting_Minimum_Cuts_7_min.mp47.41MB
45. 10_X._GRAPH_SEARCH_AND_CONNECTIVITY_Week_4/01_Graph_Search_-_Overview_23_min.mp423.25MB
46. 10_X._GRAPH_SEARCH_AND_CONNECTIVITY_Week_4/02_Breadth-First_Search_BFS-_The_Basics_14_min.mp414.28MB
47. 10_X._GRAPH_SEARCH_AND_CONNECTIVITY_Week_4/03_BFS_and_Shortest_Paths_8_min.mp47.9MB
48. 10_X._GRAPH_SEARCH_AND_CONNECTIVITY_Week_4/04_BFS_and_Undirected_Connectivity_13_min.mp413.7MB
49. 10_X._GRAPH_SEARCH_AND_CONNECTIVITY_Week_4/05_Depth-First_Search_DFS-_The_Basics_7_min.mp47.16MB
50. 10_X._GRAPH_SEARCH_AND_CONNECTIVITY_Week_4/06_Topological_Sort_22_min.mp422.08MB
51. 10_X._GRAPH_SEARCH_AND_CONNECTIVITY_Week_4/07_Computing_Strong_Components-_The_Algorithm_29_min.mp429.5MB
52. 10_X._GRAPH_SEARCH_AND_CONNECTIVITY_Week_4/08_Computing_Strong_Components-_The_Analysis_26_min.mp426.77MB
53. 10_X._GRAPH_SEARCH_AND_CONNECTIVITY_Week_4/09_Structure_of_the_Web_Optional_19_min.mp418.63MB
54. 11_XI._DIJKSTRAS_SHORTEST-PATH_ALGORITHM_Week_5/01_Dijkstras_Shortest-Path_Algorithm_21_min.mp420.96MB
55. 11_XI._DIJKSTRAS_SHORTEST-PATH_ALGORITHM_Week_5/02_Dijkstras_Algorithm-_Examples_13_min.mp412.88MB
56. 11_XI._DIJKSTRAS_SHORTEST-PATH_ALGORITHM_Week_5/03_Correctness_of_Dijkstras_Algorithm_Advanced_-_Optional_19_min.mp420.31MB
57. 11_XI._DIJKSTRAS_SHORTEST-PATH_ALGORITHM_Week_5/04_Dijkstras_Algorithm-_Implementation_and_Running_Time_26_min.mp426.46MB
58. 12_XII._HEAPS_Week_5/01_Data_Structures-_Overview_5_min.mp44.66MB
59. 12_XII._HEAPS_Week_5/02_Heaps-_Operations_and_Applications_18_min.mp418.62MB
60. 12_XII._HEAPS_Week_5/03_Heaps-_Implementation_Details_Advanced_-_Optional_21_min.mp420.92MB
61. 13_XIII._BALANCED_BINARY_SEARCH_TREES_Week_5/01_Balanced_Search_Trees-_Operations_and_Applications_11_min.mp410.99MB
62. 13_XIII._BALANCED_BINARY_SEARCH_TREES_Week_5/02_Binary_Search_Tree_Basics_Part_I_13_min.mp413.28MB
63. 13_XIII._BALANCED_BINARY_SEARCH_TREES_Week_5/03_Binary_Search_Tree_Basics_Part_II_30_min.mp429.97MB
64. 13_XIII._BALANCED_BINARY_SEARCH_TREES_Week_5/04_Red-Black_Trees_21_min.mp421.83MB
65. 13_XIII._BALANCED_BINARY_SEARCH_TREES_Week_5/05_Rotations_Advanced_-_Optional_8_min.mp410.32MB
66. 13_XIII._BALANCED_BINARY_SEARCH_TREES_Week_5/06_Insertion_in_a_Red-Black_Tree_Advanced_15_min.mp420.78MB
67. 14_XIV._HASHING-_THE_BASICS_Week_6/01_Hash_Tables-_Operations_and_Applications_19_min.mp419.73MB
68. 14_XIV._HASHING-_THE_BASICS_Week_6/02_Hash_Tables-_Implementation_Details_Part_I_19_min.mp419.88MB
69. 14_XIV._HASHING-_THE_BASICS_Week_6/03_Hash_Tables-_Implementation_Details_Part_II_22_min.mp422.53MB
70. 15_XV._UNIVERSAL_HASHING_Week_6/01_Pathological_Data_Sets_and_Universal_Hashing_Motivation_22_min.mp422.49MB
71. 15_XV._UNIVERSAL_HASHING_Week_6/02_Universal_Hashing-_Definition_and_Example_Advanced_-_Optional_26_min.mp426.15MB
72. 15_XV._UNIVERSAL_HASHING_Week_6/03_Universal_Hashing-_Analysis_of_Chaining_Advanced_-_Optional_19_min.mp418.46MB
73. 15_XV._UNIVERSAL_HASHING_Week_6/04_Hash_Table_Performance_with_Open_Addressing_Advanced_-_Optional_16_min.mp415.6MB
74. 16_XV._BLOOM_FILTERS_Week_6/01_Bloom_Filters-_The_Basics_16_min.mp415.43MB
75. 16_XV._BLOOM_FILTERS_Week_6/02_Bloom_Filters-_Heuristic_Analysis_13_min.mp413.57MB
76. 17_PREVIEW_OF_PART_2/01_Application-_Internet_Routing_Optional_11_min.mp413.85MB
77. 17_PREVIEW_OF_PART_2/02_Application-_Sequence_Alignment_Optional_9_min.mp411.1MB
78. 17_PREVIEW_OF_PART_2/03_Introduction_to_Greedy_Algorithms_Optional_13_min.mp418.04MB
79. 17_PREVIEW_OF_PART_2/04_Huffman_Codes-_Introduction_and_Motivation_Optional_9_min.mp411.89MB
80. 17_PREVIEW_OF_PART_2/05_Principles_of_Dynamic_Programming_Optional_8_min.mp412.27MB
81. 17_PREVIEW_OF_PART_2/06_The_P_vs._NP_Question_Optional_9_min.mp414.28MB
82. 17_PREVIEW_OF_PART_2/07_Algorithmic_Approaches_to_NP-Complete_Problems_Optional_13_min.mp419.86MB