An Algorithmic and Social Introduction to Computer Science (CSC-105 2000S)


Class 10: Searching

Back to Analyzing Algorithms. On to Sorting.

Held Tuesday, February 8, 2000

Overview

Today we consider the problem of searching: given a collection of values with ``keys'', find an item with a designated key.

Question 10 for today's class: Explain unambiguously how to look up a phone number in a phone book given the person's name. Also describe how to look up a person's name in the phone book given their phone number.

Question 11 for Wednesday's class: Describe how to put a pile of books in alphabetical order by author.

Notes

Contents

Summary


Detour: Data Structures and Arrays

The Problem of Searching

Sequential Search

Binary Search


History

Saturday, 22 January 2000

Tuesday, 8 February 2000

Back to Analyzing Algorithms. On to Sorting.


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/CS105/2000S/Outlines/outline.10.html

Source text last modified Tue Feb 8 09:34:18 2000.

This page generated on Tue Feb 8 09:33:21 2000 by Siteweaver. Validate this page's HTML.

Contact our webmaster at rebelsky@grinnell.edu