# Class 48: Insertion Sort

Back to Introduction to Sorting. On to Merge Sort.

This outline is also available in PDF.

Held: Friday, April 30, 2010

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:

Notes:

• Reading for Monday: Merge Sort.
• Exam 3 is now ready for public consumption, with an all-new grading scheme.
• Professor Weinman will be running class today.
• EC for today's cool lunchtime talk!
• EC for Saturday's Field Day, provided you're not in Dag.

Overview:

• Expressing sorting algorithms in code.
• Key technique: Insertion.
• Analyzing insertion sort.

## Preparation: 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

Back to Introduction to Sorting. On to Merge Sort.

Disclaimer: I usually create these pages on the fly, which means that I rarely proofread them and they may contain bad grammar and incorrect details. It also means that I tend to update them regularly (see the history for more details). Feel free to contact me with any suggestions for changes.

This document was generated by Siteweaver on Tue May 11 09:03:16 2010.
The source to the document was last modified on Thu Jan 21 13:05:13 2010.
This document may be found at `http://www.cs.grinnell.edu/~rebelsky/Courses/CS151/2010S/Outlines/outline.48.html`.

You may wish to validate this document's HTML ; ;

Samuel A. Rebelsky, rebelsky@grinnell.edu

Copyright © 2007-10 Janet Davis, Matthew Kluber, Samuel A. Rebelsky, and Jerod Weinman. (Selected materials copyright by John David Stone and Henry Walker and used by permission.) This material is based upon work partially supported by the National Science Foundation under Grant No. CCLI-0633090. Any opinions, findings, and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of the National Science Foundation. This work is licensed under a Creative Commons Attribution-NonCommercial 2.5 License. To view a copy of this license, visit `http://creativecommons.org/licenses/by-nc/2.5/` or send a letter to Creative Commons, 543 Howard Street, 5th Floor, San Francisco, California, 94105, USA.