CourseClub ME Coursera - Algorithmic Toolbox

1. 01_programming-challenges/01_welcome/01_welcome.mp48.88MB
2. 01_programming-challenges/03_optional-solving-the-two-programming-challenges-in-c/02_solving-the-sum-of-two-digits-programming-challenges-screencast.mp49.35MB
3. 01_programming-challenges/03_optional-solving-the-two-programming-challenges-in-c/03_solving-the-maximum-pairwise-product-programming-challenge-improving-the-naive.mp418.4MB
4. 01_programming-challenges/03_optional-solving-the-two-programming-challenges-in-c/04_stress-test-implementation.mp411.94MB
5. 01_programming-challenges/03_optional-solving-the-two-programming-challenges-in-c/05_stress-test-find-the-test-and-debug.mp410.33MB
6. 01_programming-challenges/03_optional-solving-the-two-programming-challenges-in-c/06_stress-test-more-testing-submit-and-pass.mp459.69MB
7. 02_algorithmic-warm-up/01_why-study-algorithms/01_why-study-algorithms.mp414.5MB
8. 02_algorithmic-warm-up/01_why-study-algorithms/02_coming-up.mp45.9MB
9. 02_algorithmic-warm-up/02_fibonacci-numbers/01_problem-overview.mp45.61MB
10. 02_algorithmic-warm-up/02_fibonacci-numbers/02_naive-algorithm.mp48.19MB
11. 02_algorithmic-warm-up/02_fibonacci-numbers/03_efficient-algorithm.mp46.51MB
12. 02_algorithmic-warm-up/03_greatest-common-divisor/01_problem-overview-and-naive-algorithm.mp46.54MB
13. 02_algorithmic-warm-up/03_greatest-common-divisor/02_efficient-algorithm.mp48.64MB
14. 02_algorithmic-warm-up/04_big-o-notation/01_computing-runtimes.mp417.9MB
15. 02_algorithmic-warm-up/04_big-o-notation/02_asymptotic-notation.mp413.25MB
16. 02_algorithmic-warm-up/04_big-o-notation/03_big-o-notation.mp414.81MB
17. 02_algorithmic-warm-up/04_big-o-notation/04_using-big-o.mp417.61MB
18. 02_algorithmic-warm-up/05_course-overview/01_course-overview.mp418.93MB
19. 03_greedy-algorithms/01_introduction/01_largest-number.mp44.01MB
20. 03_greedy-algorithms/01_introduction/02_car-fueling.mp49.85MB
21. 03_greedy-algorithms/01_introduction/03_car-fueling-implementation-and-analysis.mp418.46MB
22. 03_greedy-algorithms/01_introduction/04_main-ingredients-of-greedy-algorithms.mp44.64MB
23. 03_greedy-algorithms/02_grouping-children/01_celebration-party-problem.mp48.94MB
24. 03_greedy-algorithms/02_grouping-children/02_efficient-algorithm-for-grouping-children.mp47.62MB
25. 03_greedy-algorithms/02_grouping-children/03_analysis-and-implementation-of-the-efficient-algorithm.mp47.93MB
26. 03_greedy-algorithms/03_fractional-knapsack/01_long-hike.mp48.79MB
27. 03_greedy-algorithms/03_fractional-knapsack/02_fractional-knapsack-implementation-analysis-and-optimization.mp49.44MB
28. 03_greedy-algorithms/03_fractional-knapsack/03_review-of-greedy-algorithms.mp44.95MB
29. 04_divide-and-conquer/01_introduction/01_intro.mp45.59MB
30. 04_divide-and-conquer/01_introduction/02_linear-search.mp411.72MB
31. 04_divide-and-conquer/01_introduction/03_binary-search.mp412.13MB
32. 04_divide-and-conquer/01_introduction/04_binary-search-runtime.mp415.48MB
33. 04_divide-and-conquer/02_polynomial-multiplication/01_problem-overview-and-naive-solution.mp411.26MB
34. 04_divide-and-conquer/02_polynomial-multiplication/02_naive-divide-and-conquer-algorithm.mp411.57MB
35. 04_divide-and-conquer/02_polynomial-multiplication/03_faster-divide-and-conquer-algorithm.mp410.17MB
36. 04_divide-and-conquer/03_master-theorem/01_what-is-the-master-theorem.mp47.45MB
37. 04_divide-and-conquer/03_master-theorem/02_proof-of-the-master-theorem.mp414.42MB
38. 04_divide-and-conquer/04_sorting-problem/01_problem-overview.mp46.64MB
39. 04_divide-and-conquer/04_sorting-problem/02_selection-sort.mp418.74MB
40. 04_divide-and-conquer/04_sorting-problem/03_merge-sort.mp426.54MB
41. 04_divide-and-conquer/04_sorting-problem/04_lower-bound-for-comparison-based-sorting.mp429.1MB
42. 04_divide-and-conquer/04_sorting-problem/05_non-comparison-based-sorting-algorithms.mp418.61MB
43. 04_divide-and-conquer/05_quick-sort/01_overview.mp45.23MB
44. 04_divide-and-conquer/05_quick-sort/02_algorithm.mp421.75MB
45. 04_divide-and-conquer/05_quick-sort/03_random-pivot.mp432.31MB
46. 04_divide-and-conquer/05_quick-sort/04_running-time-analysis-optional.mp437.78MB
47. 04_divide-and-conquer/05_quick-sort/05_equal-elements.mp414.22MB
48. 04_divide-and-conquer/05_quick-sort/06_final-remarks.mp420.03MB
49. 05_dynamic-programming-1/01_change-problem/01_change-problem.mp418.08MB
50. 05_dynamic-programming-1/02_string-comparison/01_the-alignment-game.mp414.75MB
51. 05_dynamic-programming-1/02_string-comparison/02_computing-edit-distance.mp49.76MB
52. 05_dynamic-programming-1/02_string-comparison/03_reconstructing-an-optimal-alignment.mp48.01MB
53. 06_dynamic-programming-2/01_knapsack/01_problem-overview.mp411.45MB
54. 06_dynamic-programming-2/01_knapsack/02_knapsack-with-repetitions.mp419.69MB
55. 06_dynamic-programming-2/01_knapsack/03_knapsack-without-repetitions.mp437.97MB
56. 06_dynamic-programming-2/01_knapsack/04_final-remarks.mp415.68MB
57. 06_dynamic-programming-2/02_placing-parentheses/01_problem-overview.mp414.52MB
58. 06_dynamic-programming-2/02_placing-parentheses/02_subproblems.mp414.47MB
59. 06_dynamic-programming-2/02_placing-parentheses/03_algorithm.mp419.08MB
60. 06_dynamic-programming-2/02_placing-parentheses/04_reconstructing-a-solution.mp419.84MB