Announcements

7/13/99


Click here to start


Table of Contents

Announcements

Today’s Topics

Review of Arrays

The Search Problem

More specifically. . .

How do we construct the algorithm?

One linear search solution

A second linear search solution

Efficiency

Cost of Linear Search

Binary Search

Simple idea, but . . .

Algorithm Development

Invariant?

Let’s fill in the blanks

Binary Search in Java

About this algorithm

How fast is binary search?

So, how fast?

Classes redux

The Big Picture

Author: millett

Email: millett@cs.cornell.edu

Home Page: http://www.cs.cornell.edu/cs100-su99/

Other information:
CS 100 Summer 1999 Lecture Notes