Held: Monday, 14 April 2014

Back to Outline 40 - Vectors. On to Outline 42 - Higher-Order Procedures, Revisited.

Summary

We consider techniques for analyzing the number of calls made in evaluating procedures, particularly recursive procedures. We consider why such analysis is useful.

Related Pages

• Reading: Analyzing Procedures
• Lab: Analyzing Procedures
• EBoard 41 (Source 41) (HTML 41) (PDF 41)

Overview

• Comparing algorithms.
• Two related metrics: Time and Number of steps.
• Counting procedure calls by printing.
• Tools for analysis.

Administrivia

Upcoming Work

• Reading for Tuesday: Design Patterns and Higher-Order Procedures
  • You won't find a lot new here, but it brings many common ideas together.
• Homework for Tuesday night: Project proposals.
  • No matter what the assignment says, you submit your project proposals via GitHub.
  • Please get me your project groups during class.
• Homework for Wednesday class: Pictures for project proposals.
• Lab writeup: 5d.

Admin

• CS Study break tonight at 8 pm.
• Quizzes returned.

Extra Credit

• CS extra today: Walker and Liberto on bluetooth.
• Convo Wednesday: Philip Deloria, Professor of History and Native American Studies, University of Michigan.
• CS extra next Thursday: Charlie Eddy on his project.
• Get and wear one of the "1 in 4" shirts next week. Pick up shirt Tuesday through Thursday, wear on Friday.
• Iowater project April 19 - Tag drains. Mail iowater@grinnell.edu for details.
• http://www.strikingly.com/pioneerweekend

Overview

• When comparing algorithms, we often care which one is faster.
• We can analyze by hand.
• We can carefully study the code and predict (covered in future CS courses)

Lab

• Do the lab