background preloader

Stanford CS Ed Library

Stanford CS Ed Library

Introduction to Algorithms - Massachusetts Institute of Technology Readings refer to chapters and/or sections of Introduction to Algorithms, 3rd Edition. See the table of contents. Recommended books and sites - Please add links to your favorite programming books with a short description. The goal is to make a minimal reading list to become a good programmer. Feel free to discuss the listed books and propose better alternatives. Algorithms Introduction to computer programming using LOGO language (free e-book). Math algorithms and optimization Numerical Recipes in C (free e-book). Compression and encryption Everything you need to know about cryptography in 1 hour (slides in PDF format). Text processing String-Matching Algorithms (free e-book): Boyer-Moore, Knuth-Morris-Pratt, and alike. Compilers and Languages Basics of Compiler Design by Torben Æ. The Development of the C Language by Dennis M. Functional programming Can Your Programming Language Do This by Joel Spolsky (article). Operating Systems Operating Systems, Fourth Edition by William Stallings (printed book). Computer architecture Computer Systems: A Programmer's Perspective by Randal Bryant and David O'Hallaron (printed book). Usability

CS 161 - Design and Analysis of Algorithms Course Description Course Overview: Introduction to fundamental techniques for designing and analyzing algorithms, including asymptotic analysis; divide-and-conquer algorithms and recurrences; greedy algorithms; data structures; dynamic programming; graph algorithms; and randomized algorithms. Required textbook: Kleinberg and Tardos, Algorithm Design, 2005. We will be covering most of Chapters 4–6, some parts of Chapter 13, and a couple of topics not in the book. Prerequisites: Introduction to proofs, and discrete mathematics and probability (e.g., CS 103 and Stat116). We apologize for the poor audio quality in this video. 5. 7. 8. 9. 10. 11. 12. 13. 14. 15. 16. 17. 18. 19.

Sorting Algorithm Animations Algorithms in Java, Parts 1-4, 3rd edition by Robert Sedgewick. Addison Wesley, 2003. Quicksort is Optimal by Robert Sedgewick and Jon Bentley, Knuthfest, Stanford University, January, 2002. Dual Pivot Quicksort: Code by Discussion. Bubble-sort with Hungarian (“Csángó”) folk dance YouTube video, created at Sapientia University, Tirgu Mures (Marosvásárhely), Romania. Select-sort with Gypsy folk dance YouTube video, created at Sapientia University, Tirgu Mures (Marosvásárhely), Romania. Sorting Out Sorting, Ronald M.