Lecture 5

Learning objectives

After this class, you should be able to:

  1. Explain the idea behind operation counts and asymptotic analysis of of the running time of algorithms.
  2. Given an algorithm and an operation to be counted, derive the number of those operations executed by the algorithm, as a function of the input size.
  3. Given the running time of an algorithm as a function of its input size n, and its actual running time s for some input of size m, derive its running time for a larger input size, as a function of s.

Reading assignment

  1. Chapter 2.
  2. Class notes.
  3. Lecture: Algorithm Analysis.

Exercises and review questions


Last modified: 14 Aug 2012