CS 136 Tutorials - Spring 2007

Tutorials »

Tutorial 5: big-O Notation and Proofs by Induction (June 1)

This tutorial will start by proving a function is or is not big-O of some expression. We will then move into proving big-O expressions for recursive functions. The material covered expands on main points taken from lecture module 5 (see Handouts).

  1. Functions in big-O Notation
  2. This part of the tutorial uses the definition of big-O to show that a function is big-O of an expression.

Last modified on Friday, 19 August 2011, at 18:05 hours.