From 92b4eeca4f1823ab90429cb071ac832eb3a50044 Mon Sep 17 00:00:00 2001 From: swong15 Date: Sun, 28 Dec 2014 17:00:27 -0800 Subject: [PATCH] Add UIUC CS 473/573 to list --- README.md | 4 +++- 1 file changed, 3 insertions(+), 1 deletion(-) diff --git a/README.md b/README.md index 7efa8cb..ad3207e 100644 --- a/README.md +++ b/README.md @@ -105,7 +105,9 @@ Courses *CUNY Hunter College* - This includes the introduction of hashes, heaps, various forms of trees, and graphs. It also revisits recursion and the sorting problem from a higher perspective than was presented in the prequels. On top of this, it is intended to introduce methods of algorithmic analysis. - [Lectures and Assignments](http://compsci.hunter.cuny.edu/~sweiss/course_materials/csci335/csci335_s14.php) - +- [CS 473/573](http://web.engr.illinois.edu/~jeffe/teaching/algorithms/) **Fundamental Algorithms** *Univ of Illinois, Urbana-Champaign* + - Algorithms class covering recursion, randomization, amortization, graph algorithms, network flows and hardness + ### Introduction to CS - [CS 50](https://cs50.harvard.edu/) **Introduction to Computer Science** *Harvard University* - CS50x is Harvard College's introduction to the intellectual enterprises of computer science and the art of programming for majors and non-majors alike, with or without prior programming experience. An entry-level course taught by David J. Malan.