# Program Arcade Games

With Python And PygameEnglish

Dutch - Nederlands

French

Hungarian - Magyar

Portuguese - Português

Russian - Русский

Spanish - Español

Turkish - Türkçe

# Chapter 18: Sorting

Binary searches only work on lists that are in order. So how do programs get a list in order? How does a program sort a list of items when the user clicks a column heading, or otherwise needs something sorted?

There are several algorithms that do this.
The two easiest algorithms for sorting are the *selection sort* and the
*insertion sort*. Other sorting algorithms exist as well, such as the
shell, merge, heap, and quick sorts.

The best way to get an idea on how these sorts work is to watch them.
To see common sorting algorithms in action visit this excellent website:

http://www.sorting-algorithms.com

Each sort has advantages and disadvantages. Some sort a list quickly if the list is almost in order to begin with. Some sort a list quickly if the list is in a completely random order. Other lists sort fast, but take more memory. Understanding how sorts work is important in selecting the proper sort for your program.

## 18.1 Swapping Values

Before learning to sort, we need to learn how to swap values between two variables. This is a common operation in many sorting algorithms. Suppose a program has a list that looks like the following:

list = [15,57,14,33,72,79,26,56,42,40]

The developer wants to swap positions 0 and 2, which contain the numbers 15 and 14 respectively. See Figure 18.1.

A first attempt at writing this code might look something like this:

list[0] = list[2] list[2] = list[0]

See Figure 18.2 to get an idea
on what would happen.
This clearly does not work. The first assignment `list[0] = list[2]`
causes the value 15 that exists in position 0 to be overwritten
with the 14 in position 2 and irretrievably lost.
The next line with `list[2] = list[0]` just copies the 14 back
to cell 2 which already has a 14.

To fix this problem, swapping values in an array should be done in three steps. It is necessary to create a temporary variable to hold a value during the swap operation. See Figure 18.3. The code to do the swap looks like the following:

temp = list[0] list[0] = list[2] list[2] = temp

The first line copies the value of position 0 into the `temp` variable.
This allows the code to write over position 0 with the value in position 2
without data being lost. The final line takes the old value of position 0, currently
held in the `temp` variable, and places it in position 2.

## 18.2 Selection Sort

The selection sort starts at the beginning of the list. Then code next scans the rest of the list to find the smallest number. The smallest number is swapped into location. The code then moves on to the next number. Graphically, the sort looks like Figure 18.4.

The code for a selection sort involves two nested loops. The outside loop tracks the current position that the code wants to swap the smallest value into. The inside loop starts at the current location and scans to the right in search of the smallest value. When it finds the smallest value, the swap takes place.

# The selection sort def selection_sort(list): # Loop through the entire array for curPos in range( len(list) ): # Find the position that has the smallest number # Start with the current position minPos = curPos # Scan left to right (end of the list) for scanPos in range(curPos+1, len(list) ): # Is this position smallest? if list[scanPos] < list[minPos]: # It is, mark this position as the smallest minPos = scanPos # Swap the two values temp = list[minPos] list[minPos] = list[curPos] list[curPos] = temp

The outside loop will always run $n$ times. The inside loop will run
$n/2$ times. This will be the case regardless if the list is in
order or not. The loops efficiency may be improved by checking if
`minPos` and `curPos` are equal before line 16. If
those variables are equal, there is no need to do the three lines
of swap code.

In order to test the selection sort code above, the following code
may be used. The first function will print out the list. The next
code will create a list of random numbers, print it, sort it, and then
print it again. On line 3 the `print` statement right-aligns the numbers to make
the column of numbers easier to read. Formatting print statements
will be covered in Chapter 21.

# Before this code, paste the selection sort and import random def print_list(list): for item in list: print("{:3}".format(item), end="") print() # Create a list of random numbers list = [] for i in range(10): list.append(random.randrange(100)) # Try out the sort print_list(list) selection_sort(list) print_list(list)

See an animation of the selection sort at:

http://www.sorting-algorithms.com/selection-sort

For a truly unique visualization of the selection sort, search YouTube for
“selection sort dance” or use this link:

http://youtu.be/Ns4TPTC8whw

You can trace through the code using http://pythontutor.com.

## 18.3 Insertion Sort

The insertion sort is similar to the selection sort in how the outer loop works. The insertion sort starts at the left side of the array and works to the right side. The difference is that the insertion sort does not select the smallest element and put it into place; the insertion sort selects the next element to the right of what was already sorted. Then it slides up each larger element until it gets to the correct location to insert. Graphically, it looks like Figure 18.5.

The insertion sort breaks the list into two sections, the “sorted” half and the “unsorted” half. In each round of the outside loop, the algorithm will grab the next unsorted element and insert it into the list.

In the code below, the `keyPos` marks the boundary between
the sorted and unsorted portions of the list. The algorithim scans to the
left of `keyPos` using the variable `scanPos`. Note that in
the insertion short, `scanPos` goes down to the left, rather than up
to the right. Each cell
location that is larger than `keyValue` gets moved up (to the right)
one location.

When the loop finds a location smaller than `keyValue`, it stops
and puts `keyValue` to the left of it.

The outside loop with an insertion sort will run $n$ times. The inside loop will run an average of $n/2$ times if the loop is randomly shuffled. If the loop is close to a sorted loop already, then the inside loop does not run very much, and the sort time is closer to $n$.

def insertion_sort(list): # Start at the second element (pos 1). # Use this element to insert into the # list. for keyPos in range(1, len(list)): # Get the value of the element to insert keyValue = list[keyPos] # Scan from right to the left (start of list) scanPos = keyPos - 1 # Loop each element, moving them up until # we reach the position the while (scanPos >= 0) and (list[scanPos] > keyValue): list[scanPos + 1] = list[scanPos] scanPos = scanPos - 1 # Everything's been moved out of the way, insert # the key into the correct location list[scanPos + 1] = keyValue

See an animation of the insertion sort at:

http://www.sorting-algorithms.com/selection-sort

For another dance interpretation, search YouTube for
“insertion sort dance” or use this link:

http://youtu.be/ROalU379l3U

You can trace through the code using http://pythontutor.com.

You are not logged in. Log in here and track your progress.

About | Buy the Book | Help Translate | My College | My Twitter |

English version by Paul Vincent Craven

Russian version by Vladimir Slav

Turkish version by Güray Yildirim

Dutch version by Frank Waegeman

Hungarian version by Nagi Attila

Portuguese version by Tati Carvalho

Spanish version by Aitor Peinador