Skip navigation.

CS 135 Programming Logic

Urn World Tutorial

Chapter 10: Sorting Arrays

A major lesson from the previous chapter is that searching a sorted array is much faster than searching an unsorted array. The next question is how much work is required to sort an array? The answer is that sorting an array is not trivial. We will develop three sorting algorithms in this chapter. You need to memorize the mechanics of each one.

  1. Bubble Sort
  2. Selection Sort
  3. Insertion Sort
  4. Comparing Sort Algorithms
  5. Advanced Sorting Algorithms
  6. Problems