[CourseClub.ME] Coursera - Algorithmic Toolbox

01_programming-challenges/03_optional-solving-the-two-programming-challenges-in-c/06_stress-test-more-testing-submit-and-pass.mp4

06_dynamic-programming-2/01_knapsack/03_knapsack-without-repetitions.mp4

04_divide-and-conquer/05_quick-sort/04_running-time-analysis-optional.mp4

04_divide-and-conquer/05_quick-sort/03_random-pivot.mp4

04_divide-and-conquer/04_sorting-problem/04_lower-bound-for-comparison-based-sorting.mp4

04_divide-and-conquer/04_sorting-problem/03_merge-sort.mp4

04_divide-and-conquer/05_quick-sort/02_algorithm.mp4

04_divide-and-conquer/05_quick-sort/06_final-remarks.mp4

06_dynamic-programming-2/02_placing-parentheses/04_reconstructing-a-solution.mp4

06_dynamic-programming-2/01_knapsack/02_knapsack-with-repetitions.mp4

06_dynamic-programming-2/02_placing-parentheses/03_algorithm.mp4

02_algorithmic-warm-up/05_course-overview/01_course-overview.mp4

04_divide-and-conquer/04_sorting-problem/02_selection-sort.mp4

04_divide-and-conquer/04_sorting-problem/05_non-comparison-based-sorting-algorithms.mp4

03_greedy-algorithms/01_introduction/03_car-fueling-implementation-and-analysis.mp4

01_programming-challenges/03_optional-solving-the-two-programming-challenges-in-c/03_solving-the-maximum-pairwise-product-programming-challenge-improving-the-naive.mp4

05_dynamic-programming-1/01_change-problem/01_change-problem.mp4

02_algorithmic-warm-up/04_big-o-notation/01_computing-runtimes.mp4

02_algorithmic-warm-up/04_big-o-notation/04_using-big-o.mp4

06_dynamic-programming-2/01_knapsack/04_final-remarks.mp4

04_divide-and-conquer/01_introduction/04_binary-search-runtime.mp4

02_algorithmic-warm-up/04_big-o-notation/03_big-o-notation.mp4

05_dynamic-programming-1/02_string-comparison/01_the-alignment-game.mp4

06_dynamic-programming-2/02_placing-parentheses/01_problem-overview.mp4

02_algorithmic-warm-up/01_why-study-algorithms/01_why-study-algorithms.mp4

06_dynamic-programming-2/02_placing-parentheses/02_subproblems.mp4

04_divide-and-conquer/03_master-theorem/02_proof-of-the-master-theorem.mp4

04_divide-and-conquer/05_quick-sort/05_equal-elements.mp4

02_algorithmic-warm-up/04_big-o-notation/02_asymptotic-notation.mp4

04_divide-and-conquer/01_introduction/03_binary-search.mp4

01_programming-challenges/03_optional-solving-the-two-programming-challenges-in-c/04_stress-test-implementation.mp4

04_divide-and-conquer/01_introduction/02_linear-search.mp4

04_divide-and-conquer/02_polynomial-multiplication/02_naive-divide-and-conquer-algorithm.mp4

06_dynamic-programming-2/01_knapsack/01_problem-overview.mp4

04_divide-and-conquer/02_polynomial-multiplication/01_problem-overview-and-naive-solution.mp4

01_programming-challenges/03_optional-solving-the-two-programming-challenges-in-c/05_stress-test-find-the-test-and-debug.mp4

05_dynamic-programming-1/01_change-problem/01_change-problem_4-dynprog-1-changeproblem.pdf

04_divide-and-conquer/02_polynomial-multiplication/03_faster-divide-and-conquer-algorithm.mp4

03_greedy-algorithms/01_introduction/02_car-fueling.mp4

05_dynamic-programming-1/02_string-comparison/02_computing-edit-distance.mp4

03_greedy-algorithms/03_fractional-knapsack/02_fractional-knapsack-implementation-analysis-and-optimization.mp4

01_programming-challenges/03_optional-solving-the-two-programming-challenges-in-c/02_solving-the-sum-of-two-digits-programming-challenges-screencast.mp4

03_greedy-algorithms/02_grouping-children/01_celebration-party-problem.mp4

01_programming-challenges/01_welcome/01_welcome.mp4

03_greedy-algorithms/03_fractional-knapsack/01_long-hike.mp4

02_algorithmic-warm-up/03_greatest-common-divisor/02_efficient-algorithm.mp4

02_algorithmic-warm-up/02_fibonacci-numbers/02_naive-algorithm.mp4

05_dynamic-programming-1/02_string-comparison/03_reconstructing-an-optimal-alignment.mp4

03_greedy-algorithms/02_grouping-children/03_analysis-and-implementation-of-the-efficient-algorithm.mp4

03_greedy-algorithms/02_grouping-children/02_efficient-algorithm-for-grouping-children.mp4