From b6d50b14f0b692e2dbf63040ca095947c903d436 Mon Sep 17 00:00:00 2001 From: "saif.sohomow" Date: Fri, 6 Mar 2020 12:06:47 +0400 Subject: [PATCH] Algorithms Specialization - Breaks down specialization into individual courses See: https://github.com/ossu/computer-science/issues/645#issuecomment-588705984 --- README.md | 9 ++++++--- 1 file changed, 6 insertions(+), 3 deletions(-) diff --git a/README.md b/README.md index 5b688f1..fac9633 100644 --- a/README.md +++ b/README.md @@ -275,9 +275,12 @@ Courses | Duration | Effort | Additional Text / Assignments| Prerequisites `NP-completeness` `and more` -Courses | Duration | Prerequisites -:-- | :--: | :--: -[Algorithms](https://www.coursera.org/specializations/algorithms) | 80 hours | any programming language, Mathematics for Computer Science +Courses | Duration | Effort | Prerequisites +:-- | :--: | :--: | :--: +[Divide and Conquer, Sorting and Searching, and Randomized Algorithms](https://www.coursera.org/learn/algorithms-divide-conquer) | 4 weeks | 4-8 hours/week | any programming language, Mathematics for Computer Science +[Graph Search, Shortest Paths, and Data Structures](https://www.coursera.org/learn/algorithms-graphs-data-structures) | 4 weeks | 4-8 hours/week | Divide and Conquer, Sorting and Searching, and Randomized Algorithms +[Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming](https://www.coursera.org/learn/algorithms-greedy) | 4 weeks | 4-8 hours/week | Graph Search, Shortest Paths, and Data Structures +[Shortest Paths Revisited, NP-Complete Problems and What To Do About Them](https://www.coursera.org/learn/algorithms-npcomplete) | 4 weeks | 4-8 hours/week | Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming ### Core applications