Lesson A17

Quadratic Sorting Algorithms

Lesson Overview: In this lesson, you will learn about three sorting algorithms: bubble, selection, and insertion. You are responsible for knowing how they work, but you do not necessarily need to memorize and reproduce the code. After counting the number of steps of each algorithm, you will have a sense of the relative speeds of these three sorts.

Sorting Template Program

Bubble Sort

Selection Sort

Insertion Sort

Counting Steps

Animated Sorting Simulations

Sorting Objects

Summary

Z-1

Lab 17.1 Bubblesort

Z-2

Lab 17.2 Selectionsort

Z-3

Lab 17.3 Insertionsort

Z-4

Lab 17.4 Quadsort

Lesson Vocab

BUBBLE SORT

A quadratic sort using a nested loop and very simple comparisons.

INSERTION SORT

A quadratic sort using a nested loop and that places data into the appropriate spot.

QUADRATIC SORT

A general type of sort with a number of steps increasing with the square of the size.

SELECTION SORT

A quadratic sort using a nested loop that goes through the whole list, finds the smallest or biggest item, and swaps that item to the beginning or end.

STUB

A routine that can be called but is not complete.

SWAP

Switching two data members of a list with each other.