http://www.cs.toronto.edu/~krueger/cscB63h/w07/lectures/
CSC B63 Winter 2007 - Lecture Schedule
Week Topics Readings Notes 1 Jan 8 Course Introduction Review of time complexity of algorithms and asymptotic notation Abstract data types Priority queues: heaps Ch. 1,2,3 Asymptotic bounds on worst-case time complexity (PS) Tutorial: asymptotic bounds Wee
www.cs.toronto.edu