UMBC CMSC 202, Computer Science II, Spring 1999, Sections 0101, 0102, 0103, 0104

13. Big-Oh Notation

March 16, 1999

[Previous Lecture] [Next Lecture]

Demonstration of Merge Sort (and an another example of a class with copy constructor and overloaded assignment operator)

Demonstration: The Stair-Counting Problem
Definition of Big-Oh Notation
Common Functions
- O(1) - Constant
- O(log n) - Logarithmic
- O(n) - Linear
- O(n-squared) - Quadratic
- O(2 to the n) - Exponential

[Previous Lecture] [Next Lecture]

Last Modified: 5 Apr 1999 17:09:19 EDT by Alan Baumgarten, abaumg1@cs.umbc.edu

Back up to Spring 1999 CMSC 202 Section Homepage