Held: Monday, 1 December 2014

Back to Outline 48 - An Introduction to Sorting. On to Outline 50 - Project Assessment: Images.

Summary

We move from our general exploration of sorting to the implementation of a particular sorting algorithm, insertion sort. We also explore how the running time for that algorithm varies based on the number of values we are sorting.

Related Pages

• Reading: Sorting
• Lab: Insertion Sort
• EBoard 49 (Source 49) (HTML 49)

Overview

• Insertion sort basics.
• Four questions about insertion sort.
• Analyzing insertion sort.

Administrivia

• New partners!

Upcoming Work

• Exam 4 due MONDAY, December 8.
  • Due earlier because I need time to grade before Friday.
• Lab writeup: Problems 2e and 4f: http://bit.ly/151-2014F-w49
• No reading for Tuesday (or Wednesday).

Extra Credit Opportunities

Academic

• CS Extras Thursday the 4th: Summer Opportunities in CS

Peer Support

• Karan's radio show 11pm Thursday nights on KDIC
• Evan's radio show 5pm Friday nights on KDIC
• Donna's radio show Sunday midnight on KDIC
• Noteworthy at the Dance performance (Once Upon a Time, Splintered), December 4 and 5 in Flanagan
• One acts, December 5 and 6 in Roberts
• Pioneer Swim Meet, December 5 and 6 in the Osgood

Preparation: A Few Questions on Insertion Sort

• What is the key idea in insertion sort?
• How does insertion sort differ in lists and vectors?
• Why do we provide you with three different kinds of list-based insertion sort (and four kinds of insertion sort)?

Lab

• Do the lab on insertion sort.
• Be prepared to reflect.