Held: Friday, 4 December 2015

Back to Outline 51 - Binary Search Lab. On to Outline 53 - Insertion Sort.

Summary

We explore the problem of sorting. When you sort a list, vector, or other collection, you put the elements in order. The order of the elements usually corresponds to the type of the elements. We might sort strings alphabetically, grades numerically, colors by brightness, and so on and so forth.

Related Pages

• EBoard 52 (Source 52)

Overview

• The problem of sorting.
• Writing sorting algorithms.
• Examples: Insertion, selection, etc.
• Formalizing the problem.

Administrivia

• Continue partners.
• We will continue crits of your artwork.
• We will also attempt to start some new issues.
• Friday PSA.

Upcoming Work

• Reading for Monday Sorting
• No lab writeup!
• Exam 4 prologue due TONIGHT!
• Exam 4 due Monday, Dec. 7. Email it to me as an attachment. Use your random number form last time, or grab a new one.
• Exam 4 cover sheet due Tuesday, Dec. 8.
• Exam 4 epilogue due Tuesday, Dec. 8.

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

• Dance Ensemble, Friday and Saturday at 7:30 p.m.
• Women's Basketball vs. St. Norbert, Dec. 5 at 3:00 p.m.
• One-act Festival Dec. 5 at 2pm and & Dec 6 at 7 p.m.
• Choir Concert, Dec. 6 at 2pm in Herrick.
• Sweater party, Saturday at 9pm. Wear ugly christmas sweaters and dance. Will include appropriate and inappropriate beverages. (?)
• Deshowber/Showcember, Friday, Gardner. Support lots of your peers!

Regular Peer Support

• Pals of PALS, pals@grinnell.edu, normally Saturday at 7:45 am (breakfast included; felines only), and Mondays at 4:45. Requires sign up in advance. MORE HELP NEEDED!
• Socrates Cafe', Saturdays, Younker, 2pm.
• Pun Club, Saturdays, 4pm, Way over Younker.

Misc.

• Moderation this weekend.

Upcoming Peer Support

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

Other Good Things (No Extra Credit)

• Swim Meet December 4/5.
• Jingle Bell Holiday December 4. I will not be there (swim meet), I'll try to find a way to treat you to tenderloins / chicken / potatoes.

The Problem of Sorting

• As we saw recently, one problem that seems to crop up a lot in programmming (and elsewhere) is that of sorting.
• The problem: Given a list, array, vector, sequence, or file of comparable elements, put the elements in order.
  • In order typically means that each element is no bigger than the next element. (You can also sort in decreasing order, in which case each element is no smaller than the next element.)
• We'll look at techniques for sorting vectors and lists.

Designing Sorting Algorithms

• I suggest that you think about the development of sorting algorithms in Scheme similarly to the way you think about writing many algorithms.
• Start by thinking about the way you might do it by hand.
  • We may find a few different ways to sort by hand.
  • We'll probably leave the Scheme-ification to the end.
• Generalize what you're doing.
  
  • What is the "philosophy" of your technique?
  • What are the key steps.
• Come up with some initial test cases.
• Consider whether there are any deficiences to your technique.
• Decide on your parameters (e.g., are you sorting a list or a vector).
• Translate your algorithm into Scheme.
• Test test test.

Sample Sorting Algorithms

=== Insertion Sort

• One simple sorting technique is insertion sort.
• Insertion sort operates by segmenting the list into unsorted and sorted portions, and repeatedly removing the first element from the unsorted portion and inserting it into the correct place in the sorted portion.
• This may be likened to the way typical card players sort their hands.
• How might we code this recursively?
• Does our code differ for lists and arrays?

=== Selection Sort

• Selection sort is among the simpler and more natural methods for sorting vectors.
• In this sorting algorithm, you segment the vector into two subparts, a sorted part and an unsorted part. You repeatedly find the largest of the unsorted elements, and swap it into the beginning of the sorted part. This swapping continues until there are no unsorted elements.
• Here's a potentially-helpful picture: +---+---+---+---+---+---+---+---+ | | | | | | | | | +---+---+---+---+---+---+---+---+ | Unsorted Sorted
• Note that we can also write selection sort iteratively.

A More Formal Description

• Before implementing these algorithms, let's take a look at the way we might document one (or all) of the procedures
  • Purpose?
  • Parameters?
  • Produces?
  • Preconditions?
  • Postconditions?
• Here are some postconditions I typically think about:
  • You also need to ensure that all elements in the original list are in the sorted list.
  • You also need to ensure that no other elements are in the list.