Fundamentals of Computer Science II (CSC-152 99F)


Class 24: Binary Search

Back to Project Discussion. On to Sorting Algorithms.

Held Wednesday, October 6, 1999

Overview

Today, we'll consider the joys of binary search, an important divide and conquer algorithm. We will also consider some underlying object-oriented design issues for comparing objects.

Notes

Contents

Handouts

Summary


Binary Search

Recursive and Iterative Formulations

Running Time

Using an Array

Comparing Elements


History

Tuesday, 10 August 1999

Friday, 1 October 1999

Tuesday, 5 October 1999

Wednesday, 6 October 1999

Back to Project Discussion. On to Sorting Algorithms.


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/CS152/99F/Outlines/outline.24.html

Source text last modified Wed Oct 6 09:18:03 1999.

This page generated on Wed Oct 6 09:19:02 1999 by Siteweaver. Validate this page's HTML.

Contact our webmaster at rebelsky@grinnell.edu