From 960ddd4c3da802d12193d74b64fa395eab561ad1 Mon Sep 17 00:00:00 2001 From: Joshua Hanson Date: Tue, 28 Feb 2017 20:39:48 -0500 Subject: [PATCH] Move Princeton algo to extras --- README.md | 16 ---------------- extras/courses.md | 2 ++ 2 files changed, 2 insertions(+), 16 deletions(-) diff --git a/README.md b/README.md index 56f8d96c8..42d95d1e9 100644 --- a/README.md +++ b/README.md @@ -176,13 +176,6 @@ Courses | Duration | Effort | Prerequisites ### Core theory -Algorithms and data structures is the most important subject you will learn in Core CS, and there are two major course sequences for learning it. -The Princeton Algorithms courses are highly recommended as a more practical, implementation-focused complement to the more theory-focused Stanford Algorithms courses. -Ideally, students would do both sets of courses since they complement each other nicely. -However, Part II of Princeton Algorithms is rarely available, so Stanford Algorithms is the recommended choice if you cannot do both. -Another difference is that Stanford Algorithms assignments can use any programming language; -Princeton Algorithms assignments use Java but don't require extensive Java experience. - **Topics covered**: divide and conquer; sorting and searching; @@ -196,8 +189,6 @@ dynamic programming; NP-completeness; and more. -#### Stanford Algorithms - Courses | Duration | Effort | Prerequisites :-- | :--: | :--: | :--: [Algorithms (1/4)](https://www.coursera.org/learn/algorithms-divide-conquer) | 4 weeks | 4-8 hours/week | one programming language; proofs; probability @@ -205,13 +196,6 @@ Courses | Duration | Effort | Prerequisites [Algorithms (3/4)](https://www.coursera.org/learn/algorithms-greedy) | 4 weeks | 4-8 hours/week | previous algorithms course [Algorithms (4/4)](https://www.coursera.org/learn/algorithms-npcomplete) | 4 weeks | 4-8 hours/week | previous algorithms course -#### Princeton Algorithms - -Courses | Duration | Effort | Prerequisites -:-- | :--: | :--: | :--: -[Algorithms, Part I](https://www.coursera.org/learn/algorithms-part1) | 6 weeks | 6-12 hours/week | some programming -[Algorithms, Part II](https://www.coursera.org/learn/algorithms-part2) | 6 weeks | 6-12 hours/week | Algorithms, Part I - ### Core applications **Topics covered**: diff --git a/extras/courses.md b/extras/courses.md index 1ce6ad7ca..d2b713403 100644 --- a/extras/courses.md +++ b/extras/courses.md @@ -50,6 +50,8 @@ Courses | Duration | Effort Courses | Duration | Effort :-- | :--: | :--: +[Algorithms, Part I](https://www.coursera.org/learn/algorithms-part1) | 6 weeks | 6-12 hours/week | some programming +[Algorithms, Part II](https://www.coursera.org/learn/algorithms-part2) | 6 weeks | 6-12 hours/week | Algorithms, Part I [Analysis of Algorithms (Skiena)](http://www3.cs.stonybrook.edu/~skiena/373/) | 15 weeks | 6-8 hours/week [Analysis of Algorithms (Sedgewick)](https://www.coursera.org/course/aofa)| 6 weeks | 6-8 hours/week [Programming Challenges (Skiena)](http://www3.cs.stonybrook.edu/~skiena/392/) | 14 weeks | 6-8 hours/week