Sorting

We consider one of the most commonly designed algorithms: Sorting

The Problem

Given a collection of comparable values, put them in order.

For example, given a set of cards, put them in order from smallest to largest, For two cards with the same value, put them in order Clubs, Diamonds, Hearts, Spades.

Activity

Working with a partner design a strategy for sorting cards and write it down for someone else.

Analysis

How many times do you have to look at a card to sort 13 cards?

• On average?
• Best case?
• Worst case?

What happens if you have 26 cards? Will it take twice as long? More?