Quadratic Sorting

Chapter 13 presents several

common algorithms for
sorting an array of integers.
Two slow but simple
algorithms are
Selectionsort and
Insertionsort.
This presentation
Data Structures
and Other Objects
demonstrates how the two
Using C++ algorithms work.

The presentation illustrates two quadratic sorting algorithms:

Selectionsort and Insertionsort. Before this lecture, students should
know about arrays, and should have seen some motivation for sorting
(such as binary search of a sorted array).
 2
Sorting an Array of Integers

The picture
shows an 70
array of six 60
integers that 50
we want to 40
sort from 30
smallest to 20
largest
10
0
[1]
[0] [2]
[1] [3]
[2] [4]
[3] [5]
[4] [6]
[5]

The picture shows a graphical representation of an array which we will

sort so that the smallest element ends up at the front, and the other
elements increase to the largest at the end. The bar graph indicates the
values which are in the array before sorting--for example the first
element of the array contains the integer 45.
 3
The Selectionsort Algorithm

Start by
finding the 70
smallest 60
entry. 50
40
30
20
AAAAAAA
AA
10 AAAAAAA
AA
AAAAAAA
AA
AAAAAAA
AAAA
AAAA
AAA
AAA
0 AAAAAAA
[1]
[0] [2]
[1] [3]
[2] [4]
[3] [5]
[4] [6]
[5]

The first sorting algorithm that we'll examine is called Selectionsort. It

begins by going through the entire array and finding the smallest
element. In this example, the smallest element is the number 8 at
location [4] of the array.
 4
The Selectionsort Algorithm

Start by
finding the 70
smallest 60
entry. 50
Swap the 40
smallest 30
entry with 20
the first 10
AAAAAAA
AAAA
AA
AAAAAAA
AA
AAA
AA
AAAAAAA
entry. 0
AAAA
AAAA
AAA
AAA
AAAAAAA
[1]
[0] [2]
[1] [3]
[2] [4]
[3] [5]
[4] [6]
[5]

Once we have found the smallest element, that element is swapped

with the first element of the array...
 5
The Selectionsort Algorithm

Start by
finding the 70
smallest 60
entry. 50
Swap the 40
smallest 30
entry with 20
the first 10
AAAAAAA
AAAA
AA
AAAAAAA
AA
AAA
AA
AAAAAAA
entry. 0
AAAA
AAAA
AAA
AAA
AAAAAAA
[1]
[0] [2]
[1] [3]
[2] [4]
[3] [5]
[4] [6]
[5]

...like this.

The smallest element is now at the front of the array, and we have
taken one small step toward producing a sorted array.
 6
The Selectionsort Algorithm
AAAA
AAAA AAAAAAAA
AAAAAAAA
AAAAAAAA
AA
AAAAAAAA
AAAA
AAAAAA
AAAAAAAA
AAAAAAAA AAAA AA
AAAASorted side
AAAA AAAAAA Unsorted side
AAAA AAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAA
70
Part of the 60
array is now 50
sorted. 40
30
20
AAAAAAA
AA
10 AAAA
AAAAAAA
AA
AAA
AA
AAAAAAA
AAAA
AAAA
AAA
AAA
0 AAAAAAA
[1]
[0] [2]
[1] [3]
[2] [4]
[3] [5]
[4] [6]
[5]

At this point, we can view the array as being split into two sides: To the
left of the dotted line is the "sorted side", and to the right of the dotted
line is the "unsorted side". Our goal is to push the dotted line forward,
increasing the number of elements in the sorted side, until the entire
array is sorted.
 7
The Selectionsort Algorithm
AAAA
AAAA AAAAAAAA
AAAAAAAA
AAAAAAAA
AA
AAAAAAAA
AAAA
AAAAAA
AAAAAAAA
AAAAAAAA AAAA AA
AAAASorted side
AAAA AAAAAA Unsorted side
AAAA AAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAA
70
AAAA AAA
AAAA
Find the 60
AAAAAAAA
AAAA
AAA
AAA
AAAAAAAA
A
AAAA
AA
AA
AAAAAAA AAAAAAAA
smallest AA
AAAAAAA AAAAAAAA
A
AAAA AA
AAAAAAA
AAA
AAAAAAAA
A
50 AAAAAAAA
AA AAAAAAA
AA
AAAA
AAAA
AAA
AAA
AAAAAAAA
AAAAAAAA
A AAAAAAA
AAAA AA
element in AAAAAAA AAAAAAAA
AA AAAAAAA
AA
AAA
40 AAAAAAA
AAAAAAA AAAAAAAA
AAAA
AAA
AAAAAAA
AAAAAAAAA AAAA
AAAAAAA
AAAA AAAAA AAAAAAA
the unsorted AAAA
AAAA
AAA
AAA AAAA
AAAA
AAAA
AAAAAA AAAAAAA
AAAAAAA
30 AAAAAAA
AAA
AAAAAAAA
AAAAAAAA
A
A
AAAA
AAAAAAA
AAA
side. AAAA
AAAA
AA
AAA
AA
AAA AAAA
AAAA
AAA
AAA
AAAAAAAA
AAAAAAAA AA AAAA
AAAA
AAA
AAA
20 AAAA AA
AAAAAAA
AAA AAAA
AAAAAAA
AAA AAAAAAAA
AAAAAAAA A AAAA
AAAAAAA
AAAAAAA AAAAAAA AAAAAAAA AA AAA
AAAAAAA
AAAAAAA
AA
AAAAAAA
AAAAAAA AAAAAAA AAAAAAAA A AAAAAAA AAAA AA
AAA
AA
AAAAAAA
AA AAAAAAA AAAAAAA AAAAAAAA AA AAAAAAA AAAAAAA
10 AAAA
AAAAAAA
AA
AAA
AA AAAAAAA AAAAAAA AAAA
AAAAAAAA AAAAAAA AAAAAAA
AAAAAAA AAAAAAA
AAAAAAA AAAAAAA
AAAAAAA AAAA
AAAA
AAAA AA AAAAAAA
AAAAAAA AAAAAAA
AAAAAAA
AAAA
AAAA
AAA
AAA AAAAAAA
AAAA AAAAAAA AAAAAAAA AA AAAAAAA AAAAAAA
0 AAAAAAA AAAAAAA
AAA AAAA
AAAAAAA
AAA AAAAAAAA
AAAAAAAA A AAAA
AAAAAAA
AAA AAAA
AAAAAAA
AAA
[1]
[0] [2]
[1] [3]
[2] [4]
[3] [5]
[4] [6]
[5]

Each step of the Selectionsort works by finding the smallest element in

the unsorted side. At this point, we would find the number 15 at location
[5] in the unsorted side.
 8
The Selectionsort Algorithm
AAAA
AAAA AAAAAAAA
AAAAAAAA
AAAAAAAA
AA
AAAAAAAA
AAAA
AAAAAA
AAAAAAAA
AAAAAAAA AAAA AA
AAAASorted side
AAAA AAAAAA Unsorted side
AAAA AAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAA
70
AAAA AAA
AAAA
Find the 60
AAAAAAAA
AAAA
AAA
AAA
AAAAAAAA
A
AAAA
AA
AA
AAAAAAA AAAAAAAA
smallest AA
AAAAAAA AAAAAAAA
A
AAAA AA
AAAAAAA
AAA
AAAAAAAA
A
50 AAAAAAAA
AA AAAAAAA
AA
AAAA
AAAA
AAA
AAA
AAAAAAAA
AAAAAAAA
A AAAAAAA
AAAA AA
element in AAAAAAA AAAAAAAA
AA AAAAAAA
AA
AAA
40 AAAAAAA
AAAAAAA AAAAAAAA
AAAA
AAA
AAAAAAA
AAAAAAAAA AAAA
AAAAAAA
AAAA AAAAA AAAAAAA
the unsorted AAAA
AAAA
AAA
AAA AAAA
AAAA
AAAA
AAAAAA AAAAAAA
AAAAAAA
30 AAAAAAA
AAA
AAAAAAAA
AAAAAAAA
A
A
AAAA
AAAAAAA
AAA
side. AAAA
AAAA
AAA
AAA
AAAAAAAA
AAAAAAAA AA AAAA
AAAA
AAA
AAA AAAA AA
AAA
AA
AAAAAAA
20 AAAAAAA AAAA
AAAAAAA AAAAAAAA A AAAA
AAAAAAA AAAA AA
AAAAAAA
AAAA AA
AAA AAA AAAAAAAA AA AAA AAA
AA
AAAAAAA
AA
AAAAAAA
AAAAAAA AAAA
AAAA
AAAA
AAAA A AAAAAAA
AAAAAAA AAAAAAA
AAAAAAA
Swap with AAAAAAA
AAAA
AA AAAAAAA AAAAAAA AAAAAAAA AA AAAAAAA AAAAAAA
10 AAAAAAA
AA
AAA
AA AAAAAAA
AAAAAAA AAAAAAA
AAAAAAA AAAA
AAAAAAAA
AAAA AA
AAAAAAA
AAAAAAA AAAAAAA
AAAAAAA
AAAAAAA AAAAAAA AAAAAAA AAAAAAAA AAAAAAA AAAAAAA
the front of 0
AAAA
AAAA
AAA
AAA
AAAAAAA
AAAAAAA
AAAA
AAAAAAA
AAA
AAAA
AAAA
AAA
AAAAAAA
AAA
AAAAAAAA
AAAAAAAA
AAAAAAAA
AA
A
AAAA
AAAA
AAA
AAAAAAA
AAA
AAAA
AAAA
AAA
AAAAAAA
AAA
the unsorted [1]
[0] [2]
[1] [3]
[2] [4]
[3] [5]
[4] [6]
[5]
side.

This small element is swapped with the number at the front of the
unsorted side, as shown here...
 9
The Selectionsort Algorithm
AAAA
AAAA AAAAAAAA
AAAAAAAA
AAAAAAAA
AA
AAAAAAAA
AAAA
AAAAAA
AAAAAAAA
AAAAAAAA AAAA AA
AAAASorted side
AAAA AAAAAA Unsorted side
AAAA AAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAA
70
AAAA AAA
AAAA
We have 60
AAAAAAAA
AAAA
AAA
AAA
AAAAAAAA
A
AAAA
AA
AA
AAAAAAA AAAAAAAA
increased the 50 AA
AAAAAAA AAAAAAAA
A
AAAA AA
AAAAAAA
AAA
AAAAAAAA
A
AAAAAAAA
AA AAAAAAA
AA
AAAA
AAAA
AAA
AAA
AAAAAAAA
AAAAAAAA
A AAAAAAA
AAAA AA
size of the 40 AAAAAAA AAAAAAAA
AA AAAAAAA
AA
AAA
AAAAAAA
AAAAAAA AAAAAAAA
AAAA
AAA
AAAAAAA
AAAAAAAAA AAAA
AAAAAAA
AAAA AAAAA AAAAAAA
sorted side 30 AAAA
AAAA
AAA
AAA AAAA
AAAA
AAAA
AAAAAA AAAAAAA
AAAAAAA
AAAAAAA
AAA
AAAAAAAA
AAAAAAAA
A
A
AAAA
AAAAAAA
AAA
by one AAAA
AAAA
AAA
AAA
AAAAAAAA
AAAAAAAA AA AAAA
AAAA
AAA
AAA AAAA AA
AAA
AA
AAAAAAA
20 AAAAAAA AAAA
AAAAAAA AAAAAAAA A AAAA
AAAAAAA AAAA AA
AAAAAAA
AAAA AA
AAA AAA AAAAAAAA AA AAA AAA
AA AAAAAAA AAAAAAAA AAAAAAA AAAAAAA
element. AAAAAAA
AA AAAAAAA
AAAA AA
AAA AAAA
AAAA
AAA
AAA AAAAAAAA
AAAAAAAA A
AA AAAA
AAAA
AAA
AAA AAAA
AAAA
AAA
AAA
10 AAAA
AAAAAAA
AA
AAA
AA AAAAAAA AAAAAAA AAAA
AAAAAAAA AAAAAAA AAAAAAA
AAAAAAA AAAAAAA
AAAAAAA AAAAAAA
AAAAAAA AAAA
AAAA
AAAA AA AAAAAAA
AAAAAAA AAAAAAA
AAAAAAA
AAAA
AAAA
AAA
AAA AAAAAAA
AAAA AAAAAAA AAAAAAAA AA AAAAAAA AAAAAAA
0 AAAAAAA AAAAAAA
AAA AAAA
AAAAAAA
AAA AAAAAAAA
AAAAAAAA A AAAA
AAAAAAA
AAA AAAA
AAAAAAA
AAA
[1]
[0] [2]
[1] [3]
[2] [4]
[3] [5]
[4] [6]
[5]

...and the effect is to increase the size of the sorted side by one
element.

As you can see, the sorted side always contains the smallest numbers,
and those numbers are sorted from small to large. The unsorted side
contains the rest of the numbers, and those numbers are in no
particular order.
 10
The Selectionsort Algorithm
AAAA
AAAA AAAAAAAA
AAAAAAAA
AAAAAAAA
AA
AAAAAAAA
AAAA
AAAAAA
AAAAAAAA
AAAAAAAA AAAA AA
AAAASorted side
AAAA AAAAAA Unsorted side
AAAA AAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAA
70
AAAA AAA
AAAA
The process 60
AAAAAAAA
AAAA
AAA
AAA
AAAAAAAA
A
AAAA
AA
AA
AAAAAAA AAAAAAAA Smallest
continues... AA
AAAAAAA AAAAAAAA
A
AAAA AA
AAAAAAA
AAA
AAAAAAAA
A
50 AAAAAAAA
AA AAAAAAA
AA from
AAAA
AAAA
AAA
AAA
AAAAAAAA
AAAAAAAA
A AAAAAAA
AAAA AA
AAAAAAA AAAAAAAA
AA AAAAAAA
AA
AAA unsorted
40 AAAAAAA
AAAAAAA AAAAAAAA
AAAA
AAA
AAAAAAA
AAAAAAAAA AAAA
AAAAAAA
AAAAAAA AAAA
AAAA
AAAAA
AA AAAAAAA
AAAAAAA
AAAA
AAAA
AAA AAAAAAAA AAAAAAA
30 AAAAAAA
AAA
AAAAAAAA
AAAAAAAA
A
A
AAAA
AAAAAAA
AAA
AAAA
AAAA
AAA
AAA
AAAAAAAA
AAAAAAAA AA AAAA
AAAA
AA
AAA AAAAAAA
AA
AAA AAAAAAA
20 AAAAAAA AAAA
AAAAAAA AAAAAAAA A AAAA
AAAAAAA AAAA AA
AAAAAAA
AAAA AA
AAA AAA AAAAAAAA AA AAA AAA
AA
AAAAAAA
AA
AAAAAAA
AAAAAAA AAAA
AAAA
AAAA
AAAA A AAAAAAA
AAAAAAA AAAA
AAAA
AAA
AAA
AAAAAAA
AA AAAAAAA AAAAAAA AAAAAAAA AA AAAAAAA AAAAAAA
10 AAAA
AAAAAAA
AA
AAA
AA AAAAAAA AAAAAAA AAAA
AAAAAAAA AAAAAAA
AAA AAAA AAA
AAAAAAA AAAAAAA
AAAAAAA AAAAAAA
AAAAAAA AAAA
AAAA
AAAA AA AAAA
AAAAAAA AAAAAAA
AAAAAAA AAAAAAA AAAAAAA AAAAAAAA AA AAAAAAA AAAA
AAAA
AAA
AAA
0 AAAAAAA
AAAAAAA AAAA
AAAAAAA
AAA AAAA
AAAAAAA
AAA AAAAAAAA
AAAAAAAA A AAAA
AAAAAAA
AAA AAAA
AAAAAAA
AAA
[1]
[0] [2]
[1] [3]
[2] [4]
[3] [5]
[4] [6]
[5]

Again, we find the smallest entry in the unsorted side...

 11
The Selectionsort Algorithm
AAAA
AAAA AAAAAAAA
AAAAAAAA
AAAAAAAA
AA
AAAAAAAA
AAAA
AAAAAA
AAAAAAAA
AAAAAAAA AAAA AA
AAAASorted side
AAAA AAAAAA Unsorted side
AAAA AAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAA
70
AAAA AAA
AAAA
The process 60
AAAAAAAA
AAAA
AAA
AAA
AAAAAAAA
A
AAAA
AA
AAAA
AAAA
AAAA
AAAA
A
AA
AAAAAAA
AA
AAAAAAA
continues... ap AAAAAAAA
A AAAA
AAAAAAA
AA
50 Sw th AAAAAAAA
AA
AAAAAAAA AAAAAAA
AA
AAAAAAA
AA AAAA
AAA
AAA
wi t AAAAAAAA
AAAA
A
AAAA
AA
AAAAAAAA
AAAA
AAAAAAA
AA
AAA
AAA
AAAAAAA
AAAAAAA
AAAAAAA
AAA
AAAAAAA
40 n
fro AAAA
AAAAAAAA
AAAA
AAAA
AAAA
A
A
AA
AAAA
AAAAAAA
AAAAAAA
AAAA
AAAAAAA
AAAAAAA
AAAAAAAA
AAAAAAAA AAAAAAA AAAAAAA
30 A AAAA
AAAAAAA AAAA
AAAAAAA
AAAAAAAA A AAA AAA
AAAA
AAAA
AA
AAA
AA
AAA
AAAAAAAA
AAAAAAAA AA AAAA
AAAA
AAA
AAA AAAA
AAAA
AAA
AAA
20 AAAAAAA AAAA AA
AAAAAAA AAAAAAAA A AAAA
AAAAAAA AAAA
AAAAAAA
AAAA AA
AAA AAA AAAAAAAA AA AAA AAA
AA
AAAAAAA
AA
AAAAAAA
AAAAAAA AAAA
AAAA
AAAA
AAAA A AAAAAAA
AAAAAAA AAAAAAA
AAAAAAA
AAAAAAA
AA AAAAAAA AAAAAAA AAAAAAAA AA AAAAAAA AAAAAAA
10 AAAA
AAAAAAA
AA
AAA
AA AAAAAAA AAAAAAA AAAA
AAAAAAAA AAAAAAA AAAAAAA
AAAAAAA AAAAAAA
AAAAAAA AAAAAAA
AAAAAAA AAAA
AAAA
AAAA AA AAAAAAA
AAAAAAA AAAAAAA
AAAAAAA
AAAA
AAAA
AAA
AAA AAAAAAA
AAAA AAAAAAA AAAAAAAA AA AAAAAAA AAAAAAA
0 AAAAAAA AAAAAAA
AAA AAAA
AAAAAAA
AAA AAAAAAAA
AAAAAAAA A AAAA
AAAAAAA
AAA AAAA
AAAAAAA
AAA
[1]
[0] [2]
[1] [3]
[2] [4]
[3] [5]
[4] [6]
[5]

...and swap this element with the front of the unsorted side.
 12
The Selectionsort Algorithm
Sorted side AAAA
AAAA AAAAAAAA
AAAAAAAA
AAAAAAAA
AAA
AAAAAAAA
AAAAAAAA
AAAAAAA
AAAAAAAA AAAA AAA
is bigger AAAA Sorted
AAAAAAAA side
AAAA AAAAAAA
AAAAAAAAAAAAAAAAAAA Unsorted side
AAAAAAAAAAAAAAAAAAAAAAA
70
AAAA AAA
AAAA
The process 60
AAAAAAAA
AAAA
AAA
AAA
AAAAAAAA
A
AAAA
AA
AAAA
AAAA
AAAA
AAAA
A
AA
AAAAAAA
AA
AAAAAAA
continues... 50 AAAAAAAA
AAAA
A
AAAA
AA AAAAAAA
AA
AAAA AA
AAAAAAA
AAA
AAAAAAAA AAAAAAA
AA AAAAAAA
AAAAAAAA
A AAAA
AAAAAAA
AA AAAAAAA
AAAAAAAA
AA
AAAAAAAA AAA AAAAAAA
40 AAAA
AAA
AAAAAAA AAA
AAAAAAA
AAAAAAAAA AAAA AAAA
AAAAA AAAAAAA AAAAAAA
AAAA
AAAA
AAAA
AAAA
AAAAAA AAAAAAA AAA
AAAAAAAA A AAAA
AAAA
AAA AAAAAAA
30 AAAAAAAA A AAAAAAA
AAA
AAAA
AAAAAAA
AAA
AAAA
AAAA
AA
AAA
AA
AAA
AAAAAAAA
AAAAAAAA AA AAAA
AAAA
AAA
AAA AAAA
AAAA
AAA
AAA
20 AAAAAAA AAAA AA
AAAAAAA AAAAAAAA A AAAA
AAAAAAA AAAA
AAAAAAA
AAAA AA
AAA AAA AAAAAAAA AA AAA AAA
AA
AAAAAAA
AA
AAAAAAA
AAAAAAA AAAA
AAAA
AAAA
AAAA A AAAAAAA
AAAAAAA AAAAAAA
AAAAAAA
AAAAAAA
AA AAAAAAA AAAAAAA AAAAAAAA AA AAAAAAA AAAAAAA
10 AAAA
AAAAAAA
AA
AAA
AA AAAAAAA AAAAAAA AAAA
AAAAAAAA AAAAAAA AAAAAAA
AAAAAAA AAAAAAA
AAAAAAA AAAAAAA
AAAAAAA AAAA
AAAA
AAAA AA AAAAAAA
AAAAAAA AAAAAAA
AAAAAAA
AAAA
AAAA
AAA
AAA AAAAAAA
AAAA AAAAAAA AAAAAAAA AA AAAAAAA AAAAAAA
0 AAAAAAA AAAAAAA
AAA AAAA
AAAAAAA
AAA AAAAAAAA
AAAAAAAA A AAAA
AAAAAAA
AAA AAAA
AAAAAAA
AAA
[1]
[0] [2]
[1] [3]
[2] [4]
[3] [5]
[4] [6]
[5]

The sorted side now contains the three smallest elements of the array.
 13
The Selectionsort Algorithm
AAAA
AAAA AAAAAAAA
AAAAAAAA
AAAAAAAA
AAA
AAAAAAAA
AAAA
AAAAAAA
AAAAAAAA
AAAAAAAA AAAA AAA
The process AAAASorted side
AAAA AAAAAAA Unsorted side
AAAA AAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAA
keeps adding 70
AAAA AA
AAA
one more 60
AAAAAAA
AAAA
AA
AA
AAAAAAA
AAA
AAAAAAA
AAAAAAA
AA
AAAAAAA
AA
AAAAAAA
number to the 50 AAAAAAAA
AAA
AAAA
AAAAAAA
AAA AAAA AA
AAAAAAA
AAA
AAAAAAAA
AAA
AAAAAAAA
A AAAAAAA AAAAAAA
AAA AAAA
AAAAAAA AAAAAAA
sorted side. 40
AAAA
AAAA
AAAA
AA
AAAAAAAA
AAAA
A AAAA
AAA
AAA
AAAAAAA
AAAAAAA
AAAAAAA
AAAAAAA
AAAAAAAA
A AAAAAAA
AAAA AAAAAAA
AAAA
AAAAAAAA
AA AAA AAA
The sorted side 30
AAAA
AAAA
AAAA
AAAAAAAA
A
AAAA
A
AAAA
AAAA
AAA
AAAAAAA
AAA
AAAA
AAAA
AAA
AAAAAAA
AAA
AAAA
AAAA
AA
AAA
AA
AAA
AAAAAAAA
AA
AAAAAAAA AAAA
AAAA
AAA
AAA AAAA
AAAA
AAA
AAA
has the smallest 20 AAAAAAA
AA
AAAA AA
AAAAAAA
AAA AAAAAAAA
AAAAAAAAAA AAAA
AAAAAAA
AAA AAAA
AAAAAAA
AAA
AAAAAAA
AA
AAAAAAA AAAAAAA AAAAAAAA AA AAAAAAA AAAAAAA
AA AAAAAAA AAAAAAAA AAAAAAA AAAAAAA
numbers, AAAAAAA
AAAA
AA AAAAAAA AAAAAAA AAAAAAAA AA AAAAAAA AAAAAAA
10 AAAAAAA
AA
AAA
AA AAAAAAA
AAAAAAA AAAAAAA
AAAAAAA AAAAAAAA
AAAAAAAA A AAAAAAA
AAAAAAA AAAAAAA
AAAAAAA
AAAAAAA AAAAAAA AAAAAAA AAAAAAAA A AAAAAAA AAAAAAA
arranged from 0
AAAA
AAAA
AAA
AAA
AAAAAAA
AAAAAAA
AAAA
AAAAAAA
AAA
AAAA
AAAA
AAA
AAAAAAA
AAA
AAAAAAAA
AAAAAAAA
AAAAAAAA
AA
A
AAAA
AAAA
AAA
AAAAAAA
AAA
AAAA
AAAA
AAA
AAAAAAA
AAA
small to large. [1]
[0] [2]
[1] [3]
[2] [4]
[3] [5]
[4] [6]
[5]

Here is the array after increasing the sorted side to four elements.
 14
The Selectionsort Algorithm
AAAA
AAAA AAAAAAAA
AAAAAAAA
AAAAAAAA
AAA
AAAAAAAA
AAAA
AAAAAAA
AAAAAAAA
AAAAAAAA AAAA AAA
We can stop AAAASorted side
AAAA AAAAAAA Unsorted sid
AAAA AAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAA
when the 70
AAAA AA
AAA
unsorted side 60
AAAAAAA
AAAA
AA
AA
AAAAAAA
AAA
AA
AAAAAAA AAAAAAA
has just one AA
AAAAAAA AAAAAAA
AAAA AA
AAAAAAA AAAA
AAAAAAA
50 AAAA
AAAA
AAAA
AAA
AAAA
AAA AAAA
AAA
AAA AAAA
AAA
AAA
AAAAAAAA
A
AAA AAAAAAA AAAA
AAAAAAA
number, since 40
AAAA
AAAA
AAAA
AA
AAAAAAAA
AAAA
A
AAAAAAA
AAAAAAA
AAAAAAA AAAA
AAA
AAA
AAAAAAA
AAAAAAAA
A AAAAAAA
AAAA AAAAAAA
AAAA
that number AAAA
AAAA
AAAA
AA
AAAA
AAAAAAAA
A AAAA
AAAA
AAA
AAA AAAA
AAA
AAA
30 AAAAAAAA
A AAAAAAA
AAA
AAAA
AAAAAAA
AAA
must be the AAAA
AAAA
AA
AAA
AA
AAA
AAAAAAAA
AA
AAAAAAAA AAAA
AAAA
AAA
AAA AAAA
AAAA
AAA
AAA
20 AAAAAAA AAAA AA
AAAAAAA AAAAAAAAAA AAAA
AAAAAAA AAAA
AAAAAAA
AAAA AA
AAA AAA AAAAAAAA AAA AAA
AA AAAAAAA AAAAAAAA AA AAAAAAA AAAAAAA
largest number. AAAAAAA
AAAA
AA AAAAAAA
AAAA AA
AAA AAAA
AAAA
AAA
AAA AAAAAAAA
AAAAAAAA AA AAAA
AAAA
AAA
AAA AAAA
AAAA
AAA
AAA
10 AAAAAAA
AA
AAA
AA AAAAAAA
AAAAAAA AAAAAAA
AAAAAAA AAAAAAAA
AAAAAAAA A AAAAAAA
AAAAAAA AAAAAAA
AAAAAAA
AAAAAAA AAAAAAA AAAAAAA AAAAAAAA A AAAAAAA AAAAAAA
AAAA
AAAA
AAA
AAA AAAAAAA
AAAA AAAAAAA AAAAAAAA AA AAAAAAA AAAAAAA
0 AAAAAAA AAAAAAA
AAA AAAA
AAAAAAA
AAA AAAAAAAA
AAAAAAAA A AAAA
AAAAAAA
AAA AAAA
AAAAAAA
AAA
[1]
[0] [2]
[1] [3]
[2] [4]
[3] [5]
[4] [6]
[5]

And now the sorted side has five elements.

In fact, once the unsorted side is down to a single element, the sort is
completed. At this point the 5 smallest elements are in the sorted side,
and so the the one largest element is left in the unsorted side.
We are done...
 15
The Selectionsort Algorithm

The array is
now sorted. 70
AAAA AA
AAA
AA
AAAAAAA
We repeatedly 60
AA
AAAAAAA
AAAA
AAAA
AA
AAAAAAA
AAA
AAA
AA
AAAAAAA AAAAAAA
selected the AAAA AA
AAAAAAA AAAA
AAAAAAA
50 AAAA
AAAA
AAAA
AAA
AAAA
AAA AAAA
AAA
AAA AAAA
AAA
AAA
AAAAAAAA
A
AAA AAAAAAA AAAA
AAAAAAA
AAAAAAAA
AA AAAAAAA AAA
smallest 40 AAAAAAAA
AAAAAAAA
A AAAAAAA
AAAAAAA AAAAAAA
AAAAAAA
AAAAAAAA
A AAAAAAA
AAAA AAAAAAA
AAAA
AAAAAAAA
AA AAA AAA
element, and 30
AAAA
AAAA
AAAA
AAAAAAAA
A
AAAA
A
AAAA
AAAA
AAA
AAAAAAA
AAA
AAAA
AAAA
AAA
AAAAAAA
AAA
AAAA
AAAA
AA
AAA
AA
AAA
AAAAAAAA
AA
AAAAAAAA AAAA
AAAA
AAA
AAA AAAA
AAAA
AAA
AAA
moved this 20 AAAAAAA
AA
AAAA AA
AAAAAAA
AAA AAAAAAAA
AAAAAAAAAA AAAA
AAAAAAA
AAA AAAA
AAAAAAA
AAA
AAAAAAA
AA
AAAAAAA AAAAAAA AAAAAAAA AA AAAAAAA AAAAAAA
AA AAAAAAA AAAAAAAA AAAAAAA AAAAAAA
element to the AAAAAAA
AAAA
AA AAAAAAA AAAAAAA AAAAAAAA AA AAAAAAA AAAAAAA
10 AAAAAAA
AA
AAA
AA AAAAAAA
AAAAAAA AAAAAAA
AAAAAAA AAAAAAAA
AAAAAAAA A AAAAAAA
AAAAAAA AAAAAAA
AAAAAAA
AAAAAAA AAAAAAA AAAAAAA AAAAAAAA A AAAAAAA AAAAAAA
front of the 0
AAAA
AAAA
AAA
AAA
AAAAAAA
AAAAAAA
AAAA
AAAAAAA
AAA
AAAA
AAAA
AAA
AAAAAAA
AAA
AAAAAAAA
AAAAAAAA
AAAAAAAA
AA
A
AAAA
AAAA
AAA
AAAAAAA
AAA
AAAA
AAAA
AAA
AAAAAAA
AAA
unsorted side. [1]
[0] [2]
[1] [3]
[2] [4]
[3] [5]
[4] [6]
[5]

...The array is sorted.

The basic algorithm is easy to state and also easy to program.

 16
The Insertionsort Algorithm

The
Insertionsort 70
algorithm 60
also views 50
the array as 40
having a 30
sorted side 20
and an
10
unsorted
0
side. [1]
[0] [2]
[1] [3]
[2] [4]
[3] [5]
[4] [6]
[5]

Now we'll look at another sorting method called Insertionsort. The end
result will be the same: The array will be sorted from smallest to largest.
But the sorting method is different.

However, there are some common features. As with the Selectionsort,

the Insertionsort algorithm also views the array as having a sorted side
and an unsorted side, ...
 17
The Insertionsort Algorithm
AAAA
AAAA AAAAAAAA
AAAAAAAA
AAAAAAAA
AAA
AAAAAAAA
AAAA
AAAAAAA
AAAAAAAA
AAAAAAAA AAAA AAA
AAAASorted side
AAAA AAAAAAA Unsorted side
AAAA AAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAA

The sorted 70

side starts 60

with just the 50 AAAA

AAAA
AAAA
AAA
AA
AAA
AA
AAAAAAA
AA
AAA
first 40 AAAAAAA
AAAAAAA
AAAAAAA
AAAAAAA
AAAAAAA
element, 30 AAAA
AAAAAAA
AAA
AAAA
AAAA
AAA
AAA
which is not 20 AAAA
AAAAAAA
AAA
AAAAAAA
AAAA
AAAA
AAA
AAA
necessarily 10 AAAAAAA
AAAAAAA
AAAAAAA
AAAAAAA
the smallest 0 AAAA
AAAAAAA
AAA
element. [1]
[0] [2]
[1] [3]
[2] [4]
[3] [5]
[4] [6]
[5]

...like this.

However, in the Selectionsort, the sorted side always contained the

smallest elements of the array. In the Insertionsort, the sorted side will
be sorted from small to large, but the elements in the sorted side will
not necessarily be the smallest entries of the array.

Because the sorted side does not need to have the smallest entries, we
can start by placing one element in the sorted side--we don't need to
worry about sorting just one element. But we do need to worry about
how to increase the number of elements that are in the sorted side.
 18
The Insertionsort Algorithm
AAAA
AAAA AAAAAAAA
AAAAAAAA
AAAAAAAA
AAA
AAAAAAAA
AAAA
AAAAAAA
AAAAAAAA
AAAAAAAA AAAA AAA
AAAASorted side
AAAA AAAAAAA Unsorted side
AAAA AAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAA

The sorted 70

side grows 60

by taking the 50 AAAA

AAAA
AAAA
AAA
AA
AAA
AA
AAAAAAA
AA
AAA
front 40 AAAAAAA
AAAAAAA
AAAAAAA
AAAAAAA
AAAAAAA
element 30 AAAA
AAAAAAA
AAA
AAAA
AAAA
AAA
AAA AAAA
AAAA
AA
AAA
AA
AAA
from the 20 AAAA
AAAAAAA
AAA
AAAAAAA
AAAA AA
AAAAAAA
AAA
AAAAAAA
AAAA
AAAA
AAA
AAA AAAA
AAAA
AAA
AAA
unsorted 10 AAAAAAA
AAAAAAA AAAAAAA
AAAAAAA
AAAAAAA AAAAAAA
AAAAAAA AAAAAAA
side... 0 AAAA
AAAAAAA
AAA AAAA
AAAAAAA
AAA
[1]
[0] [2]
[1] [3]
[2] [4]
[3] [5]
[4] [6]
[5]

The basic approach is to take the front element from the unsorted
side...
 19
The Insertionsort Algorithm
AAAA
AAAA AAAAAAAA
AAAAAAAA
AAAAAAAA
AAA
AAAAAAAA
AAAA
AAAAAAA
AAAAAAAA
AAAAAAAA AAAA AAA
AAAASorted side
AAAA AAAAAAA Unsorted side
AAAA AAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAA

...and 70

inserting it 60

in the place 50 AAAA

AAAA
AAAA
AAA
AA
AAA
AA
AAAAAAA
AA
AAA
that keeps 40 AAAAAAA
AAAAAAA
AAAAAAA
AAAAAAA
AAAAAAA
the sorted 30 AAAA
AAAAAAA
AAA
AAAA
AAAA
AAA
AAA AAAA
AAAA
AA
AAA
AA
AAA
side 20 AAAA
AAAAAAA
AAA
AAAAAAA
AAAA AA
AAAAAAA
AAA
AAAAAAA
AAAA
AAAA
AAA
AAA AAAA
AAAA
AAA
AAA
arranged 10 AAAAAAA
AAAAAAA AAAAAAA
AAAAAAA
AAAAAAA AAAAAAA
AAAAAAA AAAAAAA
from small 0 AAAA
AAAAAAA
AAA AAAA
AAAAAAA
AAA
to large. [1]
[0] [2]
[1] [3]
[2] [4]
[3] [5]
[4] [6]
[5]

...and insert this element at the correct spot of the sorted side.

In this example, the front element of the unsorted side is 20. So the 20
must be inserted before the number 45 which is already in the sorted
side.
 20
The Insertionsort Algorithm
AAAA
AAAAAAAAAAAA
AAAAAAAA
AAAAAAAA
AAA
AAAAAAAA
AAAAAAAA
AAAAAAA
AAAAAAAA AAAA AAA
AAAA Sorted
AAAAAAAA side
AAAA AAAAAAA
AAAAAAAAAAAAAAAAAAA Unsorted side
AAAAAAAAAAAAAAAAAAAAAAA

In this 70

example, the 60

new element 50 AAAA

AAAA
AAAA
AAA
AA
AAA
AA
AAAAAAA
AA
AAA
goes in front 40 AAAAAAA
AAAAAAA
AAAAAAA
AAAAAAA
AAAAAAA
of the 30 AAAA
AAAAAAA
AAA
AAAA
AAAA
AA
AAA
AA
AAA AAAA
AAAA
AAA
AAA
element that 20 AAAA AA
AAAAAAA
AAA
AAAAAAA
AAAA
AAAAAAA
AAA
AAAAAAA
AAAA
AAAA
AAA
AAA AAAA
AAAA
AAA
AAA
was already 10 AAAAAAA
AAAAAAA AAAAAAA
AAAAAAA
AAAAAAA AAAAAAA
AAAAAAA AAAAAAA
in the sorted 0 AAAA
AAAAAAA
AAA AAAA
AAAAAAA
AAA
side. [1]
[0] [2]
[1] [3]
[2] [4]
[3] [5]
[4] [6]
[5]

After the insertion, the sorted side contains two elements. These two
elements are in order from small to large, although they are not the
smallest elements in the array.
 21
The Insertionsort Algorithm
AAAA
AAAA AAAAAAAA
AAAAAAAA
AAAAAAAA
AAA
AAAAAAAA
AAAAAAAA
AAAAAAA
AAAAAAAA AAAA AAA
AAAA Sorted
AAAAAAAA side
AAAA AAAAAAA
AAAAAAAAAAAAAAAAAAA Unsorted side
AAAAAAAAAAAAAAAAAAAAAAA

Sometimes 70

we are lucky 60
AA
AAAAAAA
AA
AAAAAAA
AAAA AA
AAAAAAA
and the new 50 AAAA
AAAA
AAAA
AAA
AA
AAA
AA AAAA
AAA
AAA
AAAAAAA
AA
AAA
AAAAAAA
AAAAAAA
inserted item 40 AAAAAAA
AAAAAAA AAAAAAA
AAAAAAA
AAAAAAA
AAAAAAA AAAAAAA
AAAAAAA
AAAAAAA AAAAAAA
doesn't need 30 AAAA
AAAAAAA
AAA
AAAA
AAAAAAA
AAA
AAAA
AAAA
AA
AAA
AA
AAA AAAA
AAAA
AAA
AAA AAAA
AAAA
AAA
AAA
to move at 20 AAAA AA
AAAAAAA
AAA
AAAAAAA
AAAA
AAAAAAA
AAA
AAAAAAA
AAAA
AAAAAAA
AAA
AAAAAAA
AAAA
AAAA
AAA
AAA AAAA
AAAA
AAA
AAA AAAA
AAAA
AAA
AAA
all. 10 AAAAAAA
AAAAAAA AAAAAAA
AAAAAAA AAAAAAA
AAAAAAA
AAAAAAA AAAAAAA AAAAAAA
AAAA
AAAA
AAA AAAAAAA AAAAAAA
0 AAAAAAA
AAA AAAA
AAAAAAA
AAA AAAA
AAAAAAA
AAA
[1]
[0] [2]
[1] [3]
[2] [4]
[3] [5]
[4] [6]
[5]

Sometimes we are lucky and the newly inserted element is already in

the right spot. This happens if the new element is larger than anything
that's already in the array.
 22
The Insertionsort Algorithm
AAAA
AAAA AAAAAAAA
AAAAAAAA
AAAAAAAA
AAA
AAAAAAAA
AAAAAAAA
AAAAAAA
AAAAAAAA AAAA AAA
AAAA Sorted
AAAAAAAA side
AAAA AAAAAAA
AAAAAAAAAAAAAAAAAAA Unsorted side
AAAAAAAAAAAAAAAAAAAAAAA

Sometimes 70
AAAA AAA
AAAA
AAA
AAAAAAAA
AAAA AAA
AAAAAAAA
A
we are lucky 60
AA
AAAAAAA AAAA
AAAA
AA
AAAA
AA
AAAAAAA AAAAAAAA
A
AAAA AA
AAAAAAA
AAAAAAAA
A
twice in a 50 AAAA
AAAA
AAAA
AAA
AA
AAA
AA AAAA
AAA
AAA AAAAAAAA
AA
AAAAAAAA
AAAAAAA
AA
AAA
AAAAAAA
AAAAAAA AAAAAAAA
AAAA
A
AAAA
AA
row. 40 AAAAAAA
AAAAAAA AAAAAAA
AAAAAAA AAAAAAAA
AAAA
AAAAAAA
AAAAAAA AAAAAAA
AAAA AAAAAAAA
AAAA
A
A
AAA AAAAAAAAAA
AAAA
AAAA
AAA AAAAAAA AAAAAAAA
30 AAAAAAA
AAA
AAAA
AAAAAAA
AAA
AAAAAAAA
AAAAAAAA
A
A
AAAA
AAAA
AA
AAA
AA
AAA AAAA
AAAA
AAA
AAA AAAA
AAAA
AAA
AAA
AAAAAAAA
AAAAAAAA AA
20 AAAA AA
AAAAAAA
AAA AAAA
AAAAAAA
AAA AAAA
AAAAAAA
AAA AAAAAAAA
AAAAAAAA A
AAAAAAA AAAAAAA AAAAAAA AAAAAAAA AA
AAAA
AAAA
AAA
AAA AAAA
AAAA
AAA
AAA AAAA
AAAA
AAA
AAA AAAAAAAA
AAAAAAAA A
AA
10 AAAAAAA AAAAAAA AAAAAAA AAAA
AAAAAAAA
AAAAAAA
AAAAAAA AAAAAAA
AAAAAAA AAAAAAA
AAAAAAA AAAA
AAAA
AAAA AA
AAAA
AAAA
AAA AAAAAAA AAAAAAA AAAAAAAA AA
0 AAAAAAA
AAA AAAA
AAAAAAA
AAA AAAA
AAAAAAA
AAA AAAAAAAA
AAAAAAAA A
[1]
[0] [2]
[1] [3]
[2] [4]
[3] [5]
[4] [6]
[5]

Sometimes we are lucky twice in a row.

 23
How to Insert One Element
AAAA
AAAA AAAAAAAA
AAAAAAAA
AAAAAAAA
AAA
Copy the AAAAAAAA
AAAAAAAA
AAAAAAA
AAAAAAAA AAAA
AAA
AAAA Sorted
AAAAAAAA side
AAAA AAAAAAA
AAAAAAAAAAAAAAAAAAA Unsorted side
AAAAAAAAAAAAAAAAAAAAAAA
new element
70
to a separate AAAA
AAAA
AAAA
AAA
AAAA
AAA
AAAA
AAAAAAAA
60 AAA
AAAA
location. AA
AAAAAAA
AAAAAAA
AAAA
AA AAAAAAAA
AAAAAAAA
AAAAAAA
AA AAAA
50 AAAAAAA
AA AAA AAAAAAAA
AAAA
AAAA
AAAA
AAA
AA AAAAAAA AAAAAAAA
AAAAAAA
AA
AAA
AAAAAAA
AAAAAAA AAAA
AAAAAAAA
AAAA
40 AAAAAAA
AAAAAAA AAAAAAA
AAAAAAA AAAAAAAA
AAAAAAAA
AAAAAAA
AAAAAAA AAAAAAA
AAAAAAA AAAAAAAA
AAAAAAAA
AAAA
AAAA
AAA AAAAAAA AAAAAAAA
30 AAAAAAA
AAA
AAAA
AAAAAAA
AAA
AAAA
AAAAAAAA
AAAA
AAAA
AAAA
AA
AAA
AA
AAA AAAA
AAAA
AAA
AAA AAAA
AAAA
AAA
AAA AAAA
AAAA
AAAA
AAAA
20 AAAA AA
AAAAAAA
AAA AAAA
AAAAAAA
AAA AAAA
AAAAAAA
AAA AAAA
AAAAAAAA
AAAA
AAAAAAA AAAAAAA AAAAAAA AAAAAAAA
AAAA
AAAA
AAA
AAA AAAA
AAAA
AAA
AAA AAAA
AAAA
AAA
AAA AAAA
AAAA
AAAA
AAAA AAAAAAA
AA
10 AAAAAAA AAAAAAA AAAAAAA AAAAAAAA AAAAAAA
AA
AAAAAAA AAAAAAA AAAAAAA AAAAAAAA AAAAAAA
AA
AAA
AAAA AA
AAA
AAAA
AAAAAAA AAAAAAA AAAAAAA AAAAAAAA AAAAAAA
AAAA AA
AAA
AA AAAA
AAAA
AAA AAAAAAA AAAAAAA AAAAAAAA AAAAAAA
AAAA
AAA 0 AAAAAAA
AAA AAAA
AAAAAAA
AAA AAAA
AAAAAAA
AAA AAAA
AAAAAAAA
AAAA AAAAAAA
AAAAAAA
AAAA
AAA
AAAA
AAA
AAAA
AAA [1]
[0] [2]
[1] [3]
[2] [4]
[3] [5]
[4] [6]
[5]

The actual insertion process requires a bit of work that is shown here.
The first step of the insertion is to make a copy of the new element.
Usually this copy is stored in a local variable. It just sits off to the side,
ready for us to use whenever we need it.
 24
How to Insert One Element

Shift
elements in
70
the sorted AAAA
AAAA
AAAA
AAA
AAAA
AAA
AAAA
AAAAAAAA
60 AAA
AAAA
side, AA
AAAAAAA
AAAAAAA
AAAA
AA AAAAAAAA
AAAAAAAA
AAAAAAA
AA AAAA
50 AAAAAAA
AA AAA AAAAAAAA
AAAA
creating an AAAA
AAAA
AAA
AA AAAAAAA AAAAAAAA
AAAAAAA
AA
AAA
AAAAAAA
AAAAAAA AAAA
AAAAAAAA
AAAA
40 AAAAAAA
AAAAAAA AAAAAAA
AAAAAAA AAAAAAAA
AAAAAAAA
open space AAAA
AAAA
AAA
AAAAAAA
AAA
AAAAAAA
AAAA
AAAA
AAA
AAA
AAAAAAAA
AAAA
AAAA
AAAA
AAAA
30 AAAA
AAAAAAA AAAA
AAAAAAA AAAA
AAAAAAAA
for the new AAA AAA AAAA
AAAA
AAAA
AA
AAA
AA
AAA AAAA
AAAA
AAA
AAA AAAA
AAAA
AAA
AAA AAAA
AAAA
AAAA
AAAA
20 AAAA AA
AAAAAAA
AAA AAAA
AAAAAAA
AAA AAAA
AAAAAAA
AAA AAAA
AAAAAAAA
AAAA
element. AAAAAAA
AAAAAAA AAAAAAA
AAAAAAA AAAAAAA
AAAAAAA AAAAAAAA
AAAAAAAA
AAAAAAA
AAAAAAA AAAAAAA
AAAAAAA AAAAAAA
AAAAAAA AAAAAAAA
AAAAAAAA
AAAAAAA
AA
AAAAAAA
AA
10 AAAAAAA AAAAAAA AAAAAAA AAAAAAAA AAAAAAA
AA
AAA
AAAA AA
AAA
AAAA
AAAAAAA AAAAAAA AAAAAAA AAAAAAAA AAAAAAA
AAAA AA
AAA
AA AAAA
AAAA
AAA AAAAAAA AAAAAAA AAAAAAAA AAAAAAA
AAAA
AAA 0 AAAAAAA
AAA AAAA
AAAAAAA
AAA AAAA
AAAAAAA
AAA AAAA
AAAAAAAA
AAAA AAAAAAA
AAAAAAA
AAAA
AAA
AAAA
AAA
AAAA
AAA [1]
[0] [2]
[1] [3]
[2] [4]
[3] [5]
[4] [6]
[5]

After we have safely made a copy of the new element, we start shifting
elements from the end of the sorted side. These elements are shifted
rightward, to create an "empty spot" for our new element to be placed.
In this example we take the last element of the sorted side and shift it
rightward one spot...
 25
How to Insert One Element

Shift
elements in
70
the sorted AAAA
AAAA
AA
AAA
AA
AAAAAAA
AAAAAAA
60 AA
AAA
side, AA
AAAAAAA
AAAAAAA
AAAA
AA AAAAAAA
AAAAAAA
AAAAAAA
AA AAAA
50 AAAAAAA
AA AAA AAAAAAA
AAA
creating an AAAA
AAAA
AAA
AA AAAAAAA AAAAAAA
AAAAAAA
AA
AAA
AAAAAAA
AAAAAAA AAAA
AAAAAAA
AAA
40 AAAAAAA
AAAAAAA AAAAAAA
AAAAAAA AAAAAAA
AAAAAAA
open space AAAA
AAAA
AAA
AAAAAAA
AAA
AAAAAAA
AAAA
AAAA
AAA
AAA
AAAAAAA
AAAA
AAAA
AAA
AAA
30 AAAA
AAAAAAA AAAA
AAAAAAA AAAA
AAAAAAA
for the new AAA AAA AAA
AAAA
AAAA
AA
AAA
AA
AAA AAAA
AAAA
AAA
AAA AAAA
AAAA
AAA
AAA AAAA
AAAA
AAA
AAA
20 AAAA AA
AAAAAAA
AAA AAAA
AAAAAAA
AAA AAAA
AAAAAAA
AAA AAAA
AAAAAAA
AAA
element. AAAAAAA
AAAAAAA AAAAAAA
AAAAAAA AAAAAAA
AAAAAAA AAAAAAA
AAAAAAA
AAAAAAA
AAAAAAA AAAAAAA
AAAAAAA AAAAAAA
AAAAAAA AAAAAAA
AAAAAAA
10 AAAAAAA AAAAAAA AAAAAAA AAAAAAA
AAA
AAAA AA
AAA
AAAA
AAAAAAA AAAAAAA AAAAAAA AAAAAAA
AAAA AA
AAA
AA AAAA
AAAA
AAA AAAAAAA AAAAAAA AAA
AAAAAAAA
AAA AAAAAAA
AAAA
AAA 0 AAAAAAA
AAA AAAA
AAAAAAA
AAA AAAA
AAAAAAA
AAA AAAAAAAA
AAA AAAAAAA
AAAAAAAA AAAAAAA
AAAA
AAA
AAAA
AAA
AAAA
AAA [1]
[0] [2]
[1] [3]
[2] [4]
[3] [5]
[4] [6]
[5]

...like this.

Is this the correct spot for the new element? No, because the new
element is smaller than the next element in the sorted section. So we
continue shifting elements rightward...
 26
How to Insert One Element

Continue
shifting
70
elements... AAAA
AAAA
AA
AAA
AA
AAAAAAA
AAAAAAA
60 AA
AAA
AAAAAAAA AAA
AAA
AAAAAAAA AAAAAAA
AAAAAAA
AAAA AAA
AAAAAAAA AAAA
AAAAAAA
50 AAAA
AAAA
AAA
AA
AAA
AA AAAA
AAAA
AAAA AAAA
AAA
AAA
AAAA
AAAAAAA
AA AAAAAAAA AAAA
AAAAAAA
AAA AAAAAAAA AAA
40 AAAAAAA
AAAAAAA AAAAAAAA
AAAAAAAA AAAAAAA
AAAAAAA
AAAAAAA
AAAAAAA AAAAAAAA
AAAAAAAA AAAAAAA
AAAAAAA
AAAA
AAAA
AAA AAAAAAAA AAAAAAA
30 AAAAAAA
AAA
AAAA
AAAAAAAA
AAAA
AAAA
AAAAAAA
AAA
AAAA
AAAA
AA
AAA
AA
AAA AAAA
AAAA
AAA
AAA AAAA
AAAA
AAAA
AAAA AAAA
AAAA
AAA
AAA
20 AAAA AA
AAAAAAA
AAA AAAA
AAAAAAA
AAA AAAA
AAAAAAAA
AAAA AAAA
AAAAAAA
AAA
AAAAAAA AAAAAAA AAAAAAAA AAAAAAA
AAAA
AAAA
AAA
AAA AAAA
AAAA
AAA
AAA AAAA
AAAA
AAAA
AAAA AAAA
AAAA
AAA
AAA
10 AAAAAAA AAAAAAA AAAAAAAA AAAAAAA
AAAAAAA AAAAAAA AAAAAAAA AAAAAAA
AAA
AAAA AA
AAA
AAAA
AAAAAAA AAAAAAA AAAAAAAA AAAAAAA
AAAA AA
AAA
AA AAAA
AAAA
AAA AAAAAAA AA
AAAAAAA
AA AAAAAAAA AAAAAAA
AAAA
AAA 0 AAAAAAA
AAA AAAA
AAAAAAA
AAA AAAAAAA
AA AAAAAAAA
AAAAAAA AAAAAAAA AAAA
AAAAAAA
AAA
AAAA
AAA
AAAA
AAA
AAAA
AAA [1]
[0] [2]
[1] [3]
[2] [4]
[3] [5]
[4] [6]
[5]

This is still not the correct spot for our new element, so we shift again...
 27
How to Insert One Element

Continue
shifting
70
elements... AAAA
AAAA
AA
AAA
AA
AAAAAAA
AAAAAAA
60 AA
AAA
AAAAAAAA AAA
AAA
AAAAAAAA AAAAAAA
AAAAAAA
AAAA AAA
AAAAAAAA AAAA
AAAAAAA
50 AAAA
AAAA
AAA
AA
AAA
AA AAAA
AAAA
AAAA AAAA
AAA
AAA
AAAA
AAAAAAA
AA AAAAAAAA AAAA
AAAAAAA
AAA AAAAAAAA AAA
40 AAAAAAA
AAAAAAA AAAAAAAA
AAAAAAAA AAAAAAA
AAAAAAA
AAAAAAA
AAAAAAA AAAAAAAA
AAAAAAAA AAAAAAA
AAAAAAA
AAAA
AAAA
AAA AAAAAAAA AAAAAAA
30 AAAAAAA
AAA
AAAA
AAAAAAAA
AAAA
AAAA
AAAAAAA
AAA
AAAA
AAAA
AA
AAA
AA
AAA AAAA
AAAA
AAA
AAA AAAA
AAAA
AAAA
AAAA AAAA
AAAA
AAA
AAA
20 AAAA AA
AAAAAAA
AAA AAAA
AAAAAAA
AAA AAAA
AAAAAAAA
AAAA AAAA
AAAAAAA
AAA
AAAAAAA AAAAAAA AAAAAAAA AAAAAAA
AAAA
AAAA
AAA
AAA AAAA
AAAA
AAA
AAA AAAA
AAAA
AAAA
AAAA AAAA
AAAA
AAA
AAA
10 AAAAAAA AAAAAAA AAAAAAAA AAAAAAA
AAAAAAA AAAAAAA AAAAAAAA AAAAAAA
AAA
AAAA AA
AAA
AAAA
AAAAAAA AAAAAAA AAAAAAAA AAAAAAA
AAAA AA
AAA
AA AAAA
AAAA
AAA AA
AAAAAAA AAAAAAA AAAAAAAA AAAAAAA
AAAAAAA AAAA
AAAAAAA
AA AAAA
AAAA
AAA 0 AAA AA
AAA AAAAAAA
AAA AAAA
AAAAAAAA
AAAA AAAA
AAAAAAA
AAA
AAAA
AAA
AAAA
AAA
AAAA
AAA [1]
[0] [2]
[1] [3]
[2] [4]
[3] [5]
[4] [6]
[5]

...and shift one more time...

 28
How to Insert One Element

...until you
reach the
70
location for AAAA
AAAA
AA
AAA
AA
AAAAAAA
AAAAAAA
60 AA
AAA
the new AAA
AAAAAAAA
AAAAAAAA
AAAA
AAA AAAAAAA
AAAAAAA
AAAAAAAA
AAA AAAA
50 AAAAAAA
AA AAAA AAAAAAA
AAA
element. AAAA
AAAA
AAA
AA AAAAAAAA AAAAAAA
AAAAAAA
AA
AAA
AAAAAAAA
AAAAAAAA AAAA
AAAAAAA
AAA
40 AAAAAAA
AAAAAAA AAAAAAAA
AAAAAAAA AAAAAAA
AAAAAAA
AAAAAAA
AAAAAAA AAAAAAAA
AAAAAAAA AAAAAAA
AAAAAAA
AAAA
AAAA
AAA AAAAAAAA AAAAAAA
30 AAAAAAA
AAA
AAAA
AAAAAAAA
AAAA
AAAA
AAAAAAA
AAA
AAAA
AAAA
AA
AAA
AA
AAA AAAA
AAAA
AAA
AAA AAAA
AAAA
AAAA
AAAA AAAA
AAAA
AAA
AAA
20 AAAA AA
AAAAAAA
AAA AAAA
AAAAAAA
AAA AAAA
AAAAAAAA
AAAA AAAA
AAAAAAA
AAA
AAAAAAA AAAAAAA AAAAAAAA AAAAAAA
AAAA
AAAA
AAA
AAA AAAA
AAAA
AAA
AAA AAAA
AAAA
AAAA
AAAA AAAA
AAAA
AAA
AAA
10 AAAAAAA AAAAAAA AAAAAAAA AAAAAAA
AAAAAAA AAAAAAA AAAAAAAA AAAAAAA
AAA
AAAA AA
AAA
AAAA
AAAAAAA AAAAAAA AAAAAAAA AAAAAAA
AAAA AA
AAA
AA AAAA
AA
AAAAAAA AAAAAAA AAAAAAA AAAAAAAA AAAAAAA
AAAAAAA
AA AAAA
AAAA
AAA 0 AA
AAA AAAAAAA
AAA AAAA
AAAAAAA
AAA AAAA
AAAAAAAA
AAAA AAAA
AAAAAAA
AAA
AAAA
AAA
AAAA
AAA
AAAA
AAA [1]
[0] [2]
[1] [3]
[2] [4]
[3] [5]
[4] [6]
[5]

Finally, this is the correct location for the new element. In general there
are two situations that indicate the "correct location" has been found:

1. We reach the front of the array (as happened here), or

2. We reached an element that is less than or equal to the new

element.
 29
How to Insert One Element
AAAA
AAAA AAAAAAAA
AAAAAAAA
AAAAAAAA
AAA
Copy the AAAAAAAA
AAAAAAAA
AAAAAAA
AAAAAAAA AAAA
AAA
AAAA Sorted
AAAAAAAA side
AAAA AAAAAAA
AAAAAAAAAAAAAAAAAAA Unsorted sid
AAAAAAAAAAAAAAAAAAAAAAA
new element
70
back into the AAAA
AAAA
AA
AAA
AA
AAAAAAA
AAAAAAA
60 AA
AAA
array, at the AAA
AAAAAAAA
AAAAAAAA
AAAA
AAA AAAAAAA
AAAAAAA
AAAAAAAA
AAA AAAA
50 AAAAAAA
AA AAAA AAAAAAA
AAA
correct AAAA
AAAA
AAA
AA AAAAAAAA AAAAAAA
AAAAAAA
AA
AAA
AAAAAAAA
AAAAAAAA AAAA
AAAAAAA
AAA
40 AAAAAAA
AAAAAAA AAAAAAAA
AAAAAAAA AAAAAAA
AAAAAAA
location. AAAA
AAAA
AAA
AAAAAAA
AAA
AAAAAAAA
AAAA
AAAA
AAAA
AAAA
AAAAAAA
AAAA
AAAA
AAA
AAA
30 AAAA
AAAAAAA AAAA
AAAAAAAA AAAA
AAAAAAA
AAA AAAA AAA
AAAA
AAAA
AA
AAA
AA
AAA AAAA
AAAA
AAA
AAA AAAA
AAAA
AAAA
AAAA AAAA
AAAA
AAA
AAA
20 AAAA AA
AAAAAAA
AAA AAAA
AAAAAAA
AAA AAAA
AAAAAAAA
AAAA AAAA
AAAAAAA
AAA
AAAAAAA AAAAAAA AAAAAAAA AAAAAAA
AAAAAAA
AA AAAA
AAAA
AAA
AAA AAAA
AAAA
AAA
AAA AAAA
AAAA
AAAA
AAAA AAAA
AAAA
AAA
AAA
10 AAAA
AAAAAAA
AA
AAA
AA AAAAAAA AAAAAAA AAAAAAAA AAAAAAA
AAAAAAA AAAAAAA AAAAAAAA AAAAAAA
AAA
AAAA AA
AAA
AAAA
AAAAAAA AAAAAAA AAAAAAA AAAAAAAA AAAAAAA
AAAA AA
AAA
AA AAAA
AAAA
AAA
AAA AAAAAAA
AAAA AAAAAAA AAAAAAAA AAAAAAA
AAAA
AAA 0 AAAAAAA AAAAAAA
AAA AAAA
AAAAAAA
AAA AAAA
AAAAAAAA
AAAA AAAA
AAAAAAA
AAA
AAAA
AAA
AAAA
AAA
AAAA
AAA [1]
[0] [2]
[1] [3]
[2] [4]
[3] [5]
[4] [6]
[5]

Once the correct spot is found, we copy the new element back into the
array. The number of elements in the sorted side has increased by
one.
 30
How to Insert One Element
AAAA
AAAA AAAAAAAA
AAAAAAAA
AAAAAAAA
AAA
AAAAAAAA
AAAAAAAA
AAAAAAA
AAAAAAAA AAAA AAA
The last AAAA Sorted
AAAAAAAA side
AAAA AAAAAAA
AAAAAAAAAAAAAAAAAAA Unsorted sid
AAAAAAAAAAAAAAAAAAAAAAA
element 70
AAAA AA
AAA
must also be 60
AAAAAAA
AAAA
AA
AA
AAAAAAA
AAA
AAA
AAAAAAAA AAAAAAA
inserted. AAA
AAAAAAAA AAAAAAA
AAAA AAA
AAAAAAAA AAAA
AAAAAAA
50 AAAA
AAAA
AAA
AA
AAA
AA AAAA
AAAA
AAAA AAAA
AAA
AAA
AAAA
AAAAAAA
AA AAAAAAAA AAAA
AAAAAAA
Start by 40 AAAA
AAA
AAA
AAAAAAA
AAAAAAAA
AAAAAAAA
AAAAAAAA AAAA
AAA
AAA
AAAAAAA
AAAAAAA
AAAAAAA AAAAAAAA
AAAAAAAA AAAAAAA
AAAAAAA
copying it... AAAA
AAAA
AAA AAAAAAAA AAAAAAA
30 AAAAAAA
AAA
AAAA
AAAAAAAA
AAAA
AAAA
AAAAAAA
AAA
AAAA
AAAA
AA
AAA
AA
AAA AAAA
AAAA
AAA
AAA AAAA
AAAA
AAAA
AAAA AAAA
AAAA
AAA
AAA
20 AAAA AA
AAAAAAA
AAA AAAA
AAAAAAA
AAA AAAA
AAAAAAAA
AAAA AAAA
AAAAAAA
AAA AAAAAAA
AAAAAAA AAAAAAA AAAAAAAA AAAAAAA AA
AAAAAAA
AAAAAAA AAAAAAA AAAAAAAA AAAAAAA AAAA AA
AAA
AA
AAAA AA
AAA AAAAAAA
AA AAAAAAA AAAAAAA AAAAAAAA AAAAAAA AAAAAAA
AAAA
AAA
AA 10 AAAA
AAAAAAA
AA AAAAAAA AAAAAAA AAAAAAAA AAAAAAA AAAAAAA
AAAA
AAAA
AA
AAA
AAA
AAA
AA
AAAAAAA AAAAAAA
AAAAAAA AAAAAAA
AAAAAAA AAAAAAAA
AAAAAAAA AAAAAAA
AAAAAAA AAAAAAA
AAAAAAA
AAA
AAAA
AAAA
AAA AAAA
AAAA
AAA
AAA AAAAAAA
AAAA AAAAAAA AAAAAAAA AAAAAAA AAAAAAA
AAAA
AAA 0 AAAAAAA AAAAAAA
AAA AAAA
AAAAAAA
AAA AAAA
AAAAAAAA
AAAA AAAA
AAAAAAA
AAA AAAA
AAAAAAA
AAA
AAAA
AAA
AAAA
AAA
AAAA
AAA [1]
[0] [2]
[1] [3]
[2] [4]
[3] [5]
[4] [6]
[5]

The last element of the array also needs to be inserted. Start by

copying it to a safe location.
 31
A Quiz

How many
shifts will 70
AAAA AA
AAA
occur before we 60
AAAAAAA
AAAA
AA
AA
AAAAAAA
AAA
AAA
AAAAAAAA AAAAAAA
copy this AAA
AAAAAAAA AAAAAAA
AAAA AAA
AAAAAAAA AAAA
AAAAAAA
50 AAAA
AAAA
AAA
AA
AAA
AA AAAA
AAAA
AAAA AAAA
AAA
AAA
AAAA
AAAAAAA
AA AAAAAAAA AAAA
AAAAAAA
element back 40 AAAA
AAA
AAA
AAAAAAA
AAAAAAAA
AAAAAAAA
AAAAAAAA AAAA
AAA
AAA
AAAAAAA
AAAAAAA AAAAAAAA
AAAA AAAAAAA
AAAA
into the array? AAAAAAA
AAAA
AAAA
AAA AAAA
AAAA
AAAA AAAA
AAA
AAA
30 AAAAAAA
AAA
AAAA
AAAAAAAA
AAAA
AAAA
AAAAAAA
AAA
AAAA
AAAA
AA
AAA
AA
AAA AAAA
AAAA
AAA
AAA AAAA
AAAA
AAAA
AAAA AAAA
AAAA
AAA
AAA
20 AAAA AA
AAAAAAA
AAA AAAA
AAAAAAA
AAA AAAA
AAAAAAAA
AAAA AAAA
AAAAAAA
AAA
AAAAAAA AAAAAAA AAAAAAAA AAAAAAA
AAAA AA
AAA AAAAAAA
AA AAAA
AAAA
AAA
AAA AAAA
AAAA
AAA
AAA AAAA
AAAA
AAAA
AAAA AAAA
AAAA
AAA
AAA
AAAA
AAA
AA 10 AAAA
AAAAAAA
AA AAAAAAA AAAAAAA AAAAAAAA AAAAAAA
AAAA
AAAA
AA
AAA
AAA
AAA
AA
AAAAAAA AAAAAAA
AAAAAAA AAAAAAA
AAAAAAA AAAAAAAA
AAAAAAAA AAAAAAA
AAAAAAA
AAA
AAAA
AAAA
AAA AAAA
AAAA
AAA
AAA AAAAAAA
AAAA AAAAAAA AAAAAAAA AAAA AA
AAA AAAAAAA
AAAAAAA AAAA
AAAAAAA AAAA
AAAAAAAA AAAA
AAAAAAA
AAA AAAA
AAAAAAA
AAAA AA
AAA
AAAA
AAA
0 AAAAAAA AAA AAA AAAA AA
AAA
AAAA
AAA
AAAA
AAA [1]
[0] [2]
[1] [3]
[2] [4]
[3] [5]
[4] [6]
[5]

Now we will shift elements rightward. How many shifts will be done?
 32
A Quiz

Four items
are shifted. 70
AAAA AA
AAA
AA
AAAAAAA
60 AAAA AA
AAAAAAA
AA
AAAAAAA AAA
AA
AAAAAAA AAAAAAA
AAAAAAA
AAAA AA
AAAAAAA AAAA
AAAAAAA
50 AAAA
AAAA
AAAA
AAA
AAAA
AAA AAAA
AAA
AAA AAAA
AAA
AAA
AAAA
AAAAAAAA
AAA AAAAAAA AAAA
AAAAAAA
AAAA AAAAAAA AAA
40 AAAAAAAA
AAAAAAAA AAAAAAA
AAAAAAA AAAAAAA
AAAAAAA
AAAAAAAA
AAAAAAAA AAAAAAA
AAAAAAA AAAAAAA
AAAAAAA
AAAA
AAAA
AAAA AAAAAAA AAAAAAA
30 AAAAAAAA
AAAA
AAAA
AAAAAAA
AAA
AAAA
AAAAAAA
AAA
AAAA
AAAA
AA
AAA
AA
AAA AAAA
AAAA
AAAA
AAAA AAAA
AAAA
AAA
AAA AAAA
AAAA
AAA
AAA
20 AAAA AA
AAAAAAA
AAA AAAA
AAAAAAAA
AAAA AAAA
AAAAAAA
AAA AAAA
AAAAAAA
AAA
AAAAAAA AAAAAAAA AAAAAAA AAAAAAA
AAAA AA
AAA AAAAAAA
AA AAAA
AAAA
AAA
AAA AAAA
AAAA
AAAA
AAAA AAAA
AAAA
AAA
AAA AAAA
AAAA
AAA
AAA
AAAA
AAA
AA 10 AAAA
AAAAAAA
AA AAAAAAA AAAAAAAA AAAAAAA AAAAAAA
AAAA
AAAA
AA
AAA
AAA
AAA
AA
AAAAAAA AAAAAAA
AAAAAAA AAAAAAAA
AAAAAAAA AAAAAAA
AAAAAAA AAAAAAA
AAAAAAA
AAA
AAAA
AAAA
AAA AAAA
AAAA
AAA
AAA AAAA
AA
AAAAAAA AAAAAAA AAAAAAAA AAAAAAA AAAAAAA
AAAAAAA
AA AAAA
AAAA
AAA 0 AAAAAAA AA
AAA AAAAAAA
AAA AAAA
AAAAAAAA
AAAA AAAA
AAAAAAA
AAA AAAA
AAAAAAA
AAA
AAAA
AAA
AAAA
AAA
AAAA
AAA [1]
[0] [2]
[1] [3]
[2] [4]
[3] [5]
[4] [6]
[5]

These four elements are shifted. But the 7 at location [0] is not shifted
since it is smaller than the new element.
 33
A Quiz

Four items
are shifted. 70
AAAA AA
AAA
AA
AAAAAAA
And then 60 AAAA AA
AAAAAAA
AAA
AA
AAAAAAA AAAAAAA
AA
AAAAAAA AAAAAAA
the element is 50 AAAA
AAAA
AAAA
AAA
AAAA
AAA
AAAA
AAAA
AA
AAAAAAA
AAA
AAA
AAAA
AAAAAAA
AAAA
AAA
AAA
AAAA
AAAAAAAA
AAA AAAAAAA AAAA
AAAAAAA
copied back AAAA AAAAAAA AAA
40 AAAAAAAA
AAAAAAAA AAAAAAA
AAAAAAA AAAAAAA
AAAAAAA
AAAAAAAA
AAAAAAAA AAAAAAA
AAAAAAA AAAAAAA
AAAAAAA
into the array. AAAA
AAAA
AAAA AAAAAAA AAAAAAA
30 AAAAAAAA
AAAA
AAAA
AAAAAAA
AAA
AAAA
AAAAAAA
AAA
AAAA
AAAA
AA
AAA
AA
AAA AAAA
AAAA
AAAA
AAAA AAAA
AAAA
AAA
AAA AAAA
AAAA
AAA
AAA
20 AAAAAAA AAAA AA
AAAAAAA AAAA
AAAAAAAA AAAA
AAAAAAA AAAA
AAAAAAA
AAAA AA
AAA AAA AAAA AAA AAA
AA
AAAAAAA
AA
AAAAAAA
AAAAAAA AAAAAAAA
AAAAAAAA AAAAAAA
AAAAAAA AAAAAAA
AAAAAAA
AAAA AA
AAA AAAAAAA
AA AAAAAAA AAAAAAA AAAAAAAA AAAAAAA AAAAAAA
AAAA
AAA
AA 10 AAAA
AAAAAAA
AA AAAAAAA AAAAAAA AAAAAAAA AAAAAAA AAAAAAA
AAAA
AAAA
AA
AAA
AAA
AAA
AA
AAAAAAA AAAAAAA
AAAAAAA AAAAAAA
AAAAAAA AAAAAAAA
AAAAAAAA AAAAAAA
AAAAAAA AAAAAAA
AAAAAAA
AAA
AAAA
AAAA
AAA AAAA
AAAA
AAA
AAA AAAAAAA
AAAA AAAAAAA AAAAAAAA AAAAAAA AAAAAAA
AAAA
AAA 0 AAAAAAA AAAAAAA
AAA AAAA
AAAAAAA
AAA AAAA
AAAAAAAA
AAAA AAAA
AAAAAAA
AAA AAAA
AAAAAAA
AAA
AAAA
AAA
AAAA
AAA
AAAA
AAA [1]
[0] [2]
[1] [3]
[2] [4]
[3] [5]
[4] [6]
[5]

The new element is inserted into the array.

 34
Timing and Other Issues

Both Selectionsort and Insertionsort have a worst-

case time of O(n2), making them impractical for
large arrays.
But they are easy to program, easy to debug.
Insertionsort also has good performance when the
array is nearly sorted to begin with.
But more sophisticated sorting algorithms are
needed when good performance is needed in all
cases for large arrays.

A quick summary of these algorithms' timing properties.

 35

Presentation copyright 1997 Addison Wesley Longman,

For use with Data Structures and Other Objects Using C++
by Michael Main and Walter Savitch.

Some artwork in the presentation is used with permission from Presentation Task Force
(copyright New Vision Technologies Inc) and Corel Gallery Clipart Catalog (copyright
Corel Corporation, 3G Graphics Inc, Archive Arts, Cartesia Software, Image Club
Graphics Inc, One Mile Up Inc, TechPool Studios, Totem Graphics Inc).

Students and instructors who use Data Structures and Other Objects Using C++ are welcome
to use this presentation however they see fit, so long as this copyright notice remains
intact.

THE END

Feel free to send your ideas to:

Michael Main
main@colorado.edu