Mark the rightmost position.
Starting with leftmost card, compare it with the card one to the right. If it it greater, swap the two cards.
Move to the next position and repeat until you get to the marked position.
If you got here without any swaps in this pass, stop. Otherwise, move the mark one to the left. If the mark is now in the leftmost position, stop. Otherwise go back to step 2.
Mark the position of the leftmost card as both start and lowest value.
From left to right compare each card to the lowest and move the lowest value mark when it is lower.
At the end of the list swap the lowest card you found with the starting position.
If the start was the rightmost position, stop. Otherwise, move both marks to the position one to the right of the old start and go back to step 2.
Mark the position second from the left.
Starting from the marked position, swap the current card with the card to its left if it is less than that card, repeating until the card is in place.
If the marked position was the rightmost position, stop. Otherwise move the mark one position to the right and go to step 2.
In pairs, with 4-8 physical cards, execute each sorting algorithm several times.
On person (the computer) should manipulate the cards and announce each step as either “compare” or “swap”.
The other person (observer) should watch to make sure the computer isn’t malfunctioning. The observer also needs to count the numer of comparisons and swaps performed and fill out the form each time.