We will cover some of these questions for review, but please attempt these questions before that comes to pass.
Starred problems are particularly difficult.
Midterm 1 topics are absent here, but will reappear on the final. Show the array after each swap, except in insertion sort. For insertion sort, show the array after each insertion. Some sorting methods, like heapsort and array-based quicksort, are not naturally stable. List the edges by giving their endpoints.