Held: Monday, 7 December 2015

Back to Outline 52 - An Introduction to Sorting. On to Outline 54 - Merge Sort.

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 53 (Source 53)

Overview

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

Administrivia

• New partners.
• Note: Our campus Spam filter blocks some email from gmail. Be careful about emailing your professors from your gmail accounts. (I'm checking with ITS as to why student email was blocked.)

Upcoming Work

• Reading for Tuesday Merge Sort
  • Our last reading!
• Exam 4 due TONIGHT at 10:30 p.m.. Email it to me as an attachment, named 000000.rkt (substituting your random number). Use your random number form last time, or grab a new one.
• Exam 4 cover sheet due Tuesday, Dec. 8. TOMORROW
• Exam 4 epilogue due Tuesday, Dec. 8. TOMORROW NIGHT!
• Today's Lab writeup (due Wednesday)
  • Email to grader-151-01@cs.grinnell.edu
  • Subject: CSC 151 Lab Writeup Class 53 (Your Names)
  • Exercises:

Extra Credit Opportunities

• If possible, send me these in advance.

Academic

• Any visit to the current show in the Faulconer gallery.
• "Summer Opportunities in CS", Thursday at 4:15 p.m.

Peer Support

• Women's Basketball vs. Carroll, Saturday, Dec. 12 at 3:00 p.m.

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.