Reading Assignments

• Monday: Sections 18.2, 18.3, 18.5. (Slides)
• Wednesday: Sections 18.6 - 18.8. (Slides)
• Friday: Clean-up of loose ends.

  NOTE: Slides are accessible only from on-campus locations.

Homework Assignments

Due: (Not Collected)


1. Monday:
   1. Computing Concepts - Review Exercises 18.3, 18.5, 18.6, 18.10.
2. Wednesday:
   1. Rewrite the search() method in the BinarySearcher class on p. 725 as a recursive method.
   2. Computing Concepts - Review Exercises 18.14.

Vocabulary

• Monday: Asymptotic Analysis
  Algorithm Complexity
  Big-Oh Notation
• Wednesday: Binary Search
  Linear Search

Related Web Sites

The Animator

A page from Hood College with a java applet that animates a variety of sorting algorithms.

Sorting Algorithms Demos

A page that gives graphical demonstrations of a number of sorting algorithms. This page includes demos of selection sort, insertion sort and merge sort.

Sample Code

Sorts.java - a class with static methods that implement Insertion Sort, Selection Sort and Merge Sort.

SortSearchTest.java - a class with several static methods that are used to test the above sorting algorithms.

SortTimer.java - a class with a main method which executes each of the above sorts on a variety of inputs and times the execution of each sort.

StopWatch.java - a class used by the SortTimer class to time the execution of the sorts.