As the title above suggests, this list of handouts was originally compiled for the first undergraduate algorithms course, but looking at it, I find that at least some could be useful for this course as well. I might add some during the course, if it appears needed.

Most of this set of handouts was collected by Andreas Koeller, but many of them existed in earlier incarnations, occasionally listed below.

• Handout 0 C++ Basic Guide, taken from the CS2005-E2000-Webpage (June 5, 2000)
  • HTML-Format
  • Postscript-Format
• Handout 1 Measuring the running time of a function
  • C-Version
  • C++-Version
  • Java-Version
  Note that the Java-Version is less accurate than the C/C++-Versions as Java can not access the C-getrusage()-function, which is necessary to separate user, system, and I/O-time from each other. The function getrusage() has time resolution of 4ms, which is often inadequate. The C-version uses gettimeofday() which gets musec reading (and allows seeing the inherent variability of execution times, even when the machine if fairly quiescent.
• Handout 2 Pointers in C++
  • a program using different kinds of pointers.
  • A handout trying to explain all combinations of ampersands, asterisks, and variable names.
• Handout 4 Sorting routines source code
  • A Java-Version of Heapsort (compile with javac HeapSort.java; run with java HeapSort) Source Code
  • C code for efficient combination of quick-sort and insertion sort. Source Code
• Handout 5 Comparing Different Sorting Algorithms---Ripped from CS2005-E2000 Webpage (and ultimately from Sun)
  • Sorting Numbers
• Handout 6 An applet visualizing Prim's Minimum Spanning Tree Algorithm
  • The Minimum Spanning Tree Applet
• Handout 7 Notes on Cryptography by Prof. Christof Paar (ECE)
  • Cryptography course
• Handout 8 The Extended Euclidean Algorithm with application to the RSA-Algorithm
  • HTML
  • PS
• Handout 9 Making Change with Coins in recursive and dynamic programming versions (C++ only).
  • Naive recursive program.
  • Dynamic Programming version
• Handout 10 Graph Traversal Strategies as Java-Animations.
  • Depth First Strategy.
  • Source Code.
  • Breadth First Strategy.
  • Source Code.
• Handout 11 Buffon's Needles Experiment as Java-Applet.
  • Buffon's Needles.
  • Source Code.
  • A proof sketch for Buffon's Theorem
  • HTML-Version. The figure is not correct, refer to the Postscript version.
• Handout 12 Vernam's One-Time Pad Encryption as Java-Applet.
  • Encryption Applet.
  • Source Code.
• Handout 13 Topological Sorting and Cycle-Detection in a Graph
  • Postscript.
  • Adobe PDF.
• Handout 13 A simple applet to draw Mandelbrot sets
  • Mandelbrot Applet
• Handout 14 An explicit solution for first order linear recurrence
  • first-order recurrence (ps)
  • first-order recurrence (pdf)
• Handout 15 An example of a good hashing function for alphanumeric keys
  • hash.c
• Handout 16 Multisection
  • Multisection in the complex plane:ps, pdf
• Handout 17 Optimal matrix chain multiplication via dynamic programming
  Here is a complete example of this method. Adapt as needed.
  • A C program