# Class 20: Analyzing Procedures

Back to Local Procedure Bindings. On to Discussion of Exam 1.

This outline is also available in PDF.

Held: Friday, February 23, 2007

Summary: Today we consider techniques for analyzing the number of steps an algorithm takes.

Related Pages:

Due

Notes:

• I anticipate returning exam 1 on Monday, so you need not do any readings over the weekend.

Overview:

• Overview.
• Steps.
• Lab.

## Overview

• When comparing algorithms, we often care which one is faster.
• We can analyze by hand.
• We can also analyze by using a library written at Grinnell.

## Steps

• Replace `define` with `define\$`.
• Type `(analyze exp procedure)`
• Alternately, type `(analyze exp)`.

## Lab

Back to Local Procedure Bindings. On to Discussion of Exam 1.

Disclaimer: I usually create these pages on the fly, which means that I rarely proofread them and they may contain bad grammar and incorrect details. It also means that I tend to update them regularly (see the history for more details). Feel free to contact me with any suggestions for changes.

This document was generated by Siteweaver on Thu Sep 13 20:54:45 2007.
The source to the document was last modified on Thu Jan 18 12:30:12 2007.
This document may be found at `http://www.cs.grinnell.edu/~rebelsky/Courses/CS151/2007S/Outlines/outline.20.html`.

You may wish to validate this document's HTML ; ;

Samuel A. Rebelsky, rebelsky@grinnell.edu

Copyright © 2007 Samuel A. Rebelsky. This work is licensed under a Creative Commons Attribution-NonCommercial 2.5 License. To view a copy of this license, visit `http://creativecommons.org/licenses/by-nc/2.5/` or send a letter to Creative Commons, 543 Howard Street, 5th Floor, San Francisco, California, 94105, USA.