Sorting

This page contains detailed information on the 10 sorting algorithms covered in class.
Each sorting technique is described in detail and sample code is provided from a working
application demonstrating it. If you want to implement any of the sorting algorithms for
closer study you will also need the sort.h header file.

Comparison-Based Sorting

  1. Transposition Sorting
    1. Bubble Sort.
  2. Insert and Keep Sorting
    1. Insertion Sort.
    2. Tree Sort.
  3. Priority Queue Sorting
    1. Selection Sort.
    2. Heap Sort.
  4. Divide and Conquer
    1. Quick Sort.
    2. Merge Sort.
  5. Diminishing Increment Sorting
    1. Shell Sort.

Address Calculation Sorting

  1. Address Calculation Sorting
    1. Proxmap Sort.
    2. Radix Sort.