CSCE 350 (Spring 2005) Lecture Notes
Some of these notes are adapted from slides provided by Anany Levitin, the author of the textbook used in the course, and his publisher, Addison-Wesley. Notes are updated: check them frequently.
Notes for Chapter 1 of the textbook (PowerPoint format)
The following five pages are scanned handwritten notes in gif format.
Simple Induction
Complete (or Strong) Induction
Proving Termination
Correctness of Recursive Algorithms
Justification of Inductive Arguments
Correctness Proof for Linear-time Maximum Contiguous Subvector Algorithm, part 1
. (See below for algorithm.)
Correctness Proof for Linear-time Maximum Contiguous Subvector Algorithm, part 2
. (See below for algorithm.)
Correctness Proof for Recursive Selection Sort
. (See below for algorithm.)
Notes on how to show correctness of an algorithm, by Amittai Aviram
Linear-time maximum contiguous subvector algorithm, from John Bentley and transcribed by Amittai Aviram
Selection sort algorithm analyzed in class on February 12, 2004
Two variations of quicksort.
Author's notes for Chapter 2 of the textbook (PowerPoint format)
Author's notes for Chapter 3 of the textbook (PowerPoint format)
Author's notes for Chapter 4 of the textbook (PowerPoint format)
Author's notes for Chapter 5 of the textbook (PowerPoint format)
Author's notes for Chapter 6 of the textbook (PowerPoint format)
Author's notes for Chapter 8 of the textbook (PowerPoint format)
Class notes for lecture of March 3, 2005 (acrobat format)
Class notes for lecture of April 5, 2005 on Dijkstra's algorithm (acrobat format)
Class notes for lecture of April 7, 2005 (acrobat format)
