CS Behind the Curtain (CS195 2003S)
Primary:
[Front Door]
[Current]
[Glance]
-
[Blurb]
[Disabilities]
[Honesty]
[Instructions]
[Links]
[Search]
[Syllabus]
Groupings:
[EBoards]
[Examples]
[Exams]
[Handouts]
[Homework]
[Labs]
[Outlines]
[Readings]
[Reference]
ECA:
[About]
[Grades]
[Quizzes]
[Submit Work]
[Change Password]
[Reset Password]
Misc:
[Walker/Fall 2001]
[SamR]
Back to Program Documentation. On to Pointers and Functions.
Held: Wednesday, 26 February 2003
Summary: Today we consider mechanisms for analyzing the running time of algorithms.
Assignments:
Notes:
speed. That is, we consider how long the algorithm takes to run.
asymptoticin that we look at the behavior as the input gets larger.
Big-Oof an algorithm.
for big enough n.
sizeof the input (e.g., the number of items in a list or vector to be manipulated).
elementof the input. Finding the smallest element in a list is often an O(n) algorithm.
divide and conquer.
unimportantbecause they can be
hiddenin the d.
countthe steps in an algorithm and then add them up. After you've taken combinatorics, you can use recurrence relations.
unimportantbecause they can be
hiddenin the d.
constant, then what else can we say about f(n) and g(n)?
shrinkfunction gives you a sense of how many recursive calls you need to do
shrinkdoes it take to reduce the argument to the base case.
analyze them experimentally? I mean that we can time them on a variety of inputs and graph the results.
Tuesday, 7 January 2003 [Samuel A. Rebelsky]
Wednesday, 26 February 2003 [Samuel A. Rebelsky]
Wednesday, 27 February 2003 [Samuel A. Rebelsky]
Back to Program Documentation. On to Pointers and Functions.
Primary:
[Front Door]
[Current]
[Glance]
-
[Blurb]
[Disabilities]
[Honesty]
[Instructions]
[Links]
[Search]
[Syllabus]
Groupings:
[EBoards]
[Examples]
[Exams]
[Handouts]
[Homework]
[Labs]
[Outlines]
[Readings]
[Reference]
ECA:
[About]
[Grades]
[Quizzes]
[Submit Work]
[Change Password]
[Reset Password]
Misc:
[Walker/Fall 2001]
[SamR]
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 Fri May 2 14:20:36 2003.
The source to the document was last modified on Thu Feb 27 23:31:11 2003.
This document may be found at http://www.cs.grinnell.edu/~rebelsky/Courses/CS195/2003S/Outlines/outline.23.html
.
You may wish to
validate this document's HTML
;
;
Check with Bobby