Often, data is much easier to process if it is arranged into sorted order. Imagine how difficult it would be to use a dictionary if the words were not in order! Sorting is a fundamental computer operation. It is important for preparing data for other operations.

This chapter explains the concept of sorting and shows one of the common sorting algorithms, insertion sort. The next chapter shows another sorting algorithm.

The first few chapters in this section illustrate sorting algorithms by sorting arrays of integers. This is done to show how the algorithms work using simple data. Usually the data to be sorted is more complicated.

- Ascending and Descending Order
- Selection Sort with Integers
- Running Time
- Simple Sorts

Is the following list of integers in sorted order? If not, sort the list into ascending order (smallest element on the left) by clicking and dragging.