The reading list of CSE202
Winter, 2008

• Concerning proofs:
  • Advice for writing proofs and
  • How to write a good proof (as a game).
• The order of magnitude (e.g., the big Oh notation):
  • Chapter 1 Section 1.1 (pp. 5-10) of Algorithms and Complexity by Herbert Wilf (free download).
  • Leeann Bent's Order Notation Summary Sheet
  • A table of growth of functions.
• Introduction to graph theory
  • Chapter 1 Section 1.6 (pp. 24-28) of Algorithms and Complexity by Herbert Wilf ( free download).
  • Electronic edition of the book on graph theory by Reinhard Diestel
• Greedy Algorithm: Some links of explanations and examples.
• NP-complete problems:
  • Definition by Mathworld.
  • Definition by NIST.
  • A list of NP-complete problems
  • NP-complete
• Recursive algorithms are nicely explained in Wilf's book (section 1.3 and 1.4, pp. 14-23).
• Sorting:
  • Bubble sort and Shaker sort
  • Selection sort
  • Heap sort
  • Insertion sort
  • Shell sort
  • Radix sort
  • Merge sort
  • Quicksort, more animation
• Trees
  • Breadth First Search tree, text by NIST , demo by Gleb.
  • Deepth First Search tree, text by NIST, demo by Gleb.
  • Minimum Spanning Trees
    • Kruskal Algorithm, more.
    • Prim Algorithm
• Tutte's Theorem for perfect matching, see the proof on page 39-41 in Distel's book.
• Demo of Dijkstra's algorithm, more.
• The union-find algorithm visualization