Fundamentals of Computer Science II (CSC-152 99S)


Class 15: Algorithm Analysis

Back to Arrays and Sequences. On to Recursion.

Held Wednesday, February 17

Summary

Contents


Handouts

Notes


Assignment 3

I believe that I now have assignment 3 from everyone who intended to do that assignment. We'll spend a little bit of time discussing the assignment, some common problems, and a better technique for the whole assignment.

What is that better technique? We can take advantage of inheritance. We'll design a general Drawable class that deals with size and color, and just have Circle and Square extend it. Now, DrawingAssistant need only have one copy of each method for Drawable, rather than two (or more).

Algorithm Analysis

Asymptotic Analysis

Eliminating Constants

Asymptotic Analysis in Practice


History


Back to Arrays and Sequences. On to Recursion.


Disclaimer Often, these pages were created "on the fly" with little, if any, proofreading. Any or all of the information on the pages may be incorrect. Please contact me if you notice errors.

This page may be found at http://www.math.grin.edu/~rebelsky/Courses/CS152/99S/Outlines/outline.15.html

Source text last modified Wed Feb 17 10:05:51 1999.

This page generated on Wed Feb 17 10:07:52 1999 by SiteWeaver. Validate this page's HTML.

Contact our webmaster at rebelsky@math.grin.edu