CS 4820 @ Cornell - update links to 2015 version

README.md

@@ -338,11 +338,10 @@ Courses
 	- This data structures course introduces C++, linked-lists, stacks, queues, trees, numerical representation, hash tables, priority queues, heaps, huffman coding, graphs, and x86 assembly.
 	- [Lectures](http://aaronbloomfield.github.io/pdr/slides/)
 	- [Assignments](http://aaronbloomfield.github.io/pdr/labs/)
-- [CS 4820](http://www.cs.cornell.edu/courses/CS4820/2014sp/) **Introduction to Analysis of Algorithms** *Cornell University* <img src="https://assets-cdn.github.com/images/icons/emoji/unicode/1f4bb.png" width="20" height="20" alt="Assignments" title="Assignments" /> <img src="https://assets-cdn.github.com/images/icons/emoji/unicode/1f4dd.png" width="20" height="20" alt="Lecture Notes" title="Lecture Notes" /> <img src="https://assets-cdn.github.com/images/icons/emoji/unicode/1f4da.png" width="20" height="20" alt="Readings" title="Readings" />
+- [CS 4820](http://www.cs.cornell.edu/courses/CS4820/2015sp/) **Introduction to Analysis of Algorithms** *Cornell University* <img src="https://assets-cdn.github.com/images/icons/emoji/unicode/1f4bb.png" width="20" height="20" alt="Assignments" title="Assignments" /> <img src="https://assets-cdn.github.com/images/icons/emoji/unicode/1f4dd.png" width="20" height="20" alt="Lecture Notes" title="Lecture Notes" /> <img src="https://assets-cdn.github.com/images/icons/emoji/unicode/1f4da.png" width="20" height="20" alt="Readings" title="Readings" />
 	-  This course develops techniques used in the design and analysis of algorithms, with an emphasis on problems arising in computing applications. Example applications are drawn from systems and networks, artificial intelligence, computer vision, data mining, and computational biology. This course covers four major algorithm design techniques (greedy algorithms, divide and conquer, dynamic programming, and network flow), computability theory focusing on undecidability, computational complexity focusing on NP-completeness, and algorithmic techniques for intractable problems, including identification of structured special cases, approximation algorithms, and local search heuristics.
-	- [Lectures](http://www.cs.cornell.edu/courses/CS4820/2014sp/lectures/)
-	- [Assignments](http://www.cs.cornell.edu/courses/CS4820/2014sp/homework/)
-	- [Syllabus](http://www.cs.cornell.edu/courses/CS4820/2014sp/syllabus/)
+	- [Lectures](http://www.cs.cornell.edu/courses/CS4820/2015sp/lectures/)
+	- [Syllabus](http://www.cs.cornell.edu/courses/CS4820/2015sp/syllabus/)
 - [CSCI 104](http://www-scf.usc.edu/~csci104/20142/lectures/) **Data Structures and Object Oriented Design** <img src="https://assets-cdn.github.com/images/icons/emoji/unicode/1f4bb.png" width="20" height="20" alt="Assignments" title="Assignments" /> <img src="https://assets-cdn.github.com/images/icons/emoji/unicode/1f4dd.png" width="20" height="20" alt="Lecture Notes" title="Lecture Notes" /> *University of Southern California (USC)*
 	- [Lectures](http://www-scf.usc.edu/~csci104/20142/lectures)
 	- [Labs](http://www-scf.usc.edu/~csci104/20142/labs)