Learning Objectives
Through readings, lecture and labs, it is expected that you are doing work and seeking help to keep pace with the below objectives:
- Sorting Algorithms
- You should be comfortable with:
- Tracing the execution of selection sort, given code
- Working out examples of both selection sort and merge sort on paper
- Comparing the performance of selection sort and merge sort
Required Reading
- Miller, Ranum and College, Chapter 5.8 (selection sort)
- Miller, Ranum and College, Chapter 5.11 (merge sort)
Supplemental Materials
We all need alternative presentations of the concepts from time to time. The following resources are optional. If something seems unclear after class, or the pratice questions seem hard for you, then explore these topics more using the resources below.
- Sorting Algorithms
-
- A visual summary of selection sort
- Sorting-Algorithms.com has language-independent visualizations of lots of sorting algorithms, including selection sort and mergesort
- Zelle, Sections 13.1, 13.3, 13.2
Practice
This part of the page should get updated by the end of the week, but we all need reminders sometimes: if it is Thursday night and this message is still here, e-mail the instructor!