CSC252a
Fall 2000
Ileana Streinu

• Some questions form homeworks: an inductive proof using a loop invariant for Selection Sort (ex. 1.2, p. 11 textbook).
• Iterative algorithms, ch. 2.3, p. 23-27 textbook.
• Iterative algorithms for sorting: selection sort, insertion sort. Sorting Algorithms (Insertion and Selection) from Dominique's page.
• Start: divide-and-conquer algorithms for sorting. Merge sort, quick sort. Merge Sort. Sorting Algorithms (QuickSort, Heapsort) from Dominique's page.
• Lecture notes.
• Reading for lectures 5 and 6: Ch. 9 textbook, Sorting algorithms: insertion sort, selection sort, merge sort, quick sort, and Ch. 8, Heapsort.