Lesson 2.2: Selection Sort
Video Lesson:
| Slides | Annotated Slides | Video |
| 2.2-selection-sort.pdf Download 2.2-selection-sort.pdf | 2.2-selection-sort-annotated.pdf Download 2.2-selection-sort-annotated.pdf |
Access Passcode: YMk%7=^1 |
Readings:
- Carrano & Henry: 11.1
- Epp : Chapter 5.5
- Zych C++ pointers.pdf
- Zych C++ arrays.pdf
Summary:
Nearly every Data Structures and Algorithms course in the world uses a simple iterative algorithm called Selection Sort as a perfect first example of analysis. In this lesson we compute the running time of Selection Sort, and we prove that it actually works!
Learning Outcomes:
Upon completion off this lesson, students will be able to:
- recognize and execute selection sort on an array of values
- evaluate the running time of selection sort
- use the selection sort loop invariant to determine an iteration number