[Skip to Body]
Primary:
[Front Door]
[Current]
[Glance]

[Honesty]
[Links]
[Syllabus]
Groupings:
[EBoards]
[Examples]
[Exams]
[Handouts]
[Homework]
[Labs]
[Outlines]
[Readings]
[Reference]
Misc:
[SamR]
[Java 1.4.2 API]
[EIJ]
[CS152 2000F]
[CS153 2004S]
Back to Project Discussion. On to Algorithm Analysis (2).
Held: Wednesday, 6 October 2004
Summary: Today we consider techniques for comparatively evaluating the running time of algorithms.
Related Pages:
Assignments
Notes:
Overview:
double result = 1.0; for (int i = 0; i < y; i++) result *= x;
To compute x^y If y is 0 return 1 Else if y is odd return x*x^(y1) Else if y is even return square(x^(y/2))
speed. That is, we consider how long the algorithm takes to run.
Back to Project Discussion. On to Algorithm Analysis (2).
[Skip to Body]
Primary:
[Front Door]
[Current]
[Glance]

[Honesty]
[Links]
[Syllabus]
Groupings:
[EBoards]
[Examples]
[Exams]
[Handouts]
[Homework]
[Labs]
[Outlines]
[Readings]
[Reference]
Misc:
[SamR]
[Java 1.4.2 API]
[EIJ]
[CS152 2000F]
[CS153 2004S]
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 Wed Dec 8 10:37:17 2004.
The source to the document was last modified on Thu Aug 26 20:22:23 2004.
This document may be found at http://www.cs.grinnell.edu/~rebelsky/Courses/CS152/2004F/Outlines/outline.24.html
.
You may wish to validate this document's HTML ; ; Check with Bobby
Samuel A. Rebelsky, rebelsky@grinnell.edu