CSC252a
Fall 2000
Ileana Streinu
Lecture 6
- Sorting algorithms, continued: merging.
- Quick sort, various pivot choosing startegies. Randomized
version of quicksort, analysis.
- Other divide-and-conquer algorithms.
- Lecture Notes.
- Use applets: Sorting
Algorithms from Dominique's page.
- Reading: ch. 9 in textbook for Sorting, ch. 4.3 for divide and conquer
Last modified Sept. 25, 2000.