CSC 344
Homework 3

Assigned 27 Feb, due 18 March

Algorithm animation

Visit Algorithms in Action, log in with username "guest" and password "adelphi", and work with the Selection Sort, Insertion Sort, and Quick Sort algorithms. For each one, read the pseudocode and single-step through a run of the algorithm. You may want to expand some of the steps so you can single-step through them at a finer level of detail, then minimize them again to get an overall view.

Problems from chapter 4 of the textbook

Problems 4.1.3, 4.1.10, 4.2.10, 4.4.1

Problems from chapter 5 of the textbook

Problems 5.1.1, 5.1.6, 5.1.9, 5.2.1, 5.2.4, 5.2.7, 5.3.1

Programming problem

5.4.3. To make this more concrete, suppose the input to your function is a string of length n. Your function should return a list of strings, all the permutations of the original string. By "lexicographic order" the book means alphabetical order, the order in which the words (and non-words) would appear in a dictionary.

Extra credit problems from chapter 5

Problems 5.2.8 and/or 5.3.10