Algorithms and OOD (CSC 207 2013F) : EBoards

CSC207.01 2013F, Class 19: Analyzing Algorithms





Comparing algorithms

Potential problems in computing running time

Asymptotic analysis

Big-O, formalized

Implications of Big-O

Doing informal asymptotic analysis

Some recurrence relations

Experimental analysis

Copyright (c) 2013 Samuel A. Rebelsky.

Creative Commons License

This work is licensed under a Creative Commons Attribution 3.0 Unported License. To view a copy of this license, visit or send a letter to Creative Commons, 543 Howard Street, 5th Floor, San Francisco, California, 94105, USA.