The following documents provide supplemental notes for the course CS 263 Design and Analysis of Algorithms. These notes are not for general distribution; they are for use only by students in CS 263. Also, they are not complete. These are only supplements to the discussions in class.

Notes by Topic

• Introduction. Growth of functions. Amortization. Data Structures. Heap sort.
  • Algorithm Analysis
  • Elementary Data Structures
  • Heaps and Priority Queues
• Graph algorithms. Depth-first search. Breadth-first search.
• Depth-first search
• Biconnectivity See also the Low-number approach, discussed in the notes by Dan Hirschberg. Also see discussion of biconnected connected components from AHU.
• Breadth-first search
• Shortest paths.
• Shortest Paths
• Sorting and Selection.
• MergeSort
• QuickSort
• Selection
• Fundamental techniques. The greedy method. Divide-and-conquer.
• The Greedy Method
• Divide-and-Conquer
• See also the Wiki page on the Master Theorem.