CPSC 200: Algorithm Analysis and Development (2007)

This page summarises important information. Click on the side-bar links for particular topics.

Outline: Click here for the course outline. Syllabus: Click here for the syllabus. Grading Scheme: Homework 25% Midterm I 20% Midterm II 20% Final 35% Final examination Wednesday, December 12. 9:00–12:00. Library 5-155.

Homework: Assignment Due Date Stop Watches* 2007-09-27 Dijkstra's Problem 2007-10-23 Sorting 2007-11-27 Random merging not due Handouts: Course Syllabus Asymptotic Notes Logarithms Plotting Advice Notes on Merge Sort* Notes on Quick Sort List Code Stopwatch Code * Now contains link to Robert's lecture notes. Links Click here to access the link from John S to the C++ template tutorial.