CPSC 201: Introduction to Computer Science
Instructor: Carsten Schürmann
Department of Computer Science
Yale University
Time: MWF 11:30-12:20
Room: AKW200
|
|
Home |
|
|
Schedule |
|
|
Handouts |
|
|
Assignments |
|
|
Projects |
|
|
Links |
Lecture 35
Today we are revisiting the "big O" calculus, for running time anyalysis. As example, we analyze why binary search in in O (log n). Reading: Algorithmics, Chapter 6.