Class 23: Sorting

Held: Wednesday, 26 February 2003

Summary: Today we revisit the problem of sorting. When you sort a list or vector, you put the elements in order (e.g., alphabetical, numerical, ...).

Related Pages:

• EBoard.
• Reading on Sorting.
• Lab on Sorting.

Assignments:

• Read Sorting.

Notes:

• Are there questions on homework 2? Reminder: I've extended the deadline until next week.
• Are there questions on the reading on searching?

Overview:

• The problem of sorting.
• Writing sorting algorithms.
• Examples: Insertion sort, Selection sort.
• Lab.

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 techinque?
  • 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 is the sort Peter sugested.
• 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.

Lab

• Start the lab.
• Be prepared to reflect.