Reading Assignment and Discussion Topics
Computer Science 111

for class on Thursday Feb. 17, 2000

Please read Sections 3.4 and 3.5.2 (we'll do the rest of 3.5 next week) of the Schneider and Gersting text, and be prepared to discuss the following:

The pseudocode of Figure 3.15 (selection sort) is a little too pseudo for your instructor. Phrases like "the end of the list" and "until the unsorted section of the list is empty" and "Select the largest number" are not very precise. Please try to sharpen up this code. Suppose you're sorting an array P, so P[i] is the ith element of the array, and i can go from 1 to n. This should let you make more concrete some of the vaguer statements in the Figure.

We will study and compare some of your solutions during this class.