[Texas PLT logo]

COMP 202: Principles of Object-Oriented Programming II

  "Big-Oh" Notation  

Accounting For The Resources Used By Computations:  "Big-Oh" notation

(written by Alan Cox)

Quick and Dirty Explanation:

Big-Oh tells us how a cost of running a program (algorithm) scales with respect to n for large values of n, e.g. linearly, quadraticly, logarithmically, etc.   The slower the cost rises with n, the better, so long as we are dealing with large values of n.



  "Big-Oh" Notation  

URL: http://www.cs.rice.edu/teaching/202/08-fall/lectures/bigOh/index.shtml
Copyright © 2008-2010 Mathias Ricken and Stephen Wong