Fundamentals of Computer Science 1 (CS151 2003S)

Class 43: Basics of Searching and Sorting

Back to Tail Recursion (2). On to Binary Search.

Held: Wednesday, 16 April 2003

Summary: Today we begin to discuss two key problems in Computer Science, searching and sorting. We also consider algorithms commonly used to solve those problems.

Related Pages:

Assignments

Notes:

Overview:

Common Problems and Algorithms

Searching

Searching in Scheme

 

History

Thursday, 16 January 2003 [Samuel A. Rebelsky]

 

Back to Tail Recursion (2). On to Binary Search.

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 Tue May 6 09:30:15 2003.
The source to the document was last modified on Thu Jan 16 13:46:00 2003.
This document may be found at http://www.cs.grinnell.edu/~rebelsky/Courses/CS151/2003S/Outlines/outline.43.html.

You may wish to validate this document's HTML ; Valid CSS! ; Check with Bobby

Samuel A. Rebelsky, rebelsky@grinnell.edu