Arjun Suresh (talk | contribs) |
|||
| (14 intermediate revisions by 2 users not shown) | |||
| Line 1: | Line 1: | ||
| − | + | <metadesc>How to solve recurrence relations, GATE materials for algorithm analysis and design, complexity analysis</metadesc> | |
| + | ==Solving Recurrence Relations== | ||
[http://www.cs.cornell.edu/courses/cs3110/2012sp/lectures/lec20-master/lec20.html Cornell] | [http://www.cs.cornell.edu/courses/cs3110/2012sp/lectures/lec20-master/lec20.html Cornell] | ||
[http://courses.engr.illinois.edu/cs573/fa2010/notes/99-recurrences.pdf Illinois] | [http://courses.engr.illinois.edu/cs573/fa2010/notes/99-recurrences.pdf Illinois] | ||
| − | [[Category: Algorithms & Data Structures]] | + | |
| + | ==Algorithm ebooks and lecture notes== | ||
| + | <!-- * [[media:Daa.torrent|DAA Torrent file]]--> | ||
| + | * [[media:Introduction_to_algorithms_2nd_edition_solutions_instructors.manual.pdf| Cormen Solution manual]] | ||
| + | * [[media: The C Programming Language.pdf |C by Dennis Ritchie]] | ||
| + | * [http://computacion.cs.cinvestav.mx/~efranco/docencia/analisisdealgoritmos/files/books/IntroductionToAlgorithms-Cormen.pdf Cormen] | ||
| + | * [http://www.cs.usfca.edu/~galles/visualization/Algorithms.html Visualize and learn] | ||
| + | |||
| + | ==Complexity== | ||
| + | [[NP, NP Complete, NP Hard| NP, NP Complete, NP Hard Problems in Simple Terms]] | ||
| + | |||
| + | {{Template:FB}} | ||
| + | |||
| + | [[Category: Algorithms & Data Structures Notes]] | ||
Cornell Illinois
NP, NP Complete, NP Hard Problems in Simple Terms
GATECSE