Skip to content
Rubberduck

Sorting Techniques

Write the classic sorting algorithms, explain their speed and stability, and pick the right one for a job.

4 trail maps · 8 articles · 25 min reading, plus a task to try in each article

Last verified

Start the trail

First up: Sort with Python, 3 min

Before you start

Trail maps

  • Simple sorts 3 articles

    Sort with Python, then write your first sorts by hand.

  • Faster sorts 2 articles

    Split the problem to sort large lists quickly.

  • Choosing a sort 2 articles

    Understand stability and measure real speed.

  • Proof project 1 article

    Put the trail together and prove you reached the destination.

  1. Article 1: Sort with Python3 min. Part of Simple sorts. Start here. Done. Up next.
  2. Article 2: Selection sort3 min. Part of Simple sorts. Done. Up next. Learn first: Sort with Python.
  3. Article 3: Insertion sort4 min. Part of Simple sorts. Done. Up next. Learn first: Selection sort.
  4. Article 4: Merge sort4 min. Part of Faster sorts. Done. Up next. Learn first: Insertion sort.
  5. Article 5: Quicksort4 min. Part of Faster sorts. Done. Up next. Learn first: Merge sort.
  6. Article 6: Stable sorting and keys2 min. Part of Choosing a sort. Done. Up next. Learn first: Sort with Python.
  7. Article 7: Compare sorting speeds3 min. Part of Choosing a sort. Done. Up next. Learn first: Quicksort, Stable sorting and keys.
  8. Article 8: Sort a list of records2 min. Part of Proof project. Done. Up next. Learn first: Compare sorting speeds.

  1. Simple sorts

    1. Article 1: Sort with Python
      3 min Done. Up next.
    2. Article 2: Selection sort
      3 min · Learn first: 1 Done. Up next. (Sort with Python)
    3. Article 3: Insertion sort
      4 min · Learn first: 2 Done. Up next. (Selection sort)

  2. Faster sorts

    1. Article 4: Merge sort
      4 min · Learn first: 3 Done. Up next. (Insertion sort)
    2. Article 5: Quicksort
      4 min · Learn first: 4 Done. Up next. (Merge sort)

  3. Choosing a sort

    1. Article 6: Stable sorting and keys
      2 min · Learn first: 1 Done. Up next. (Sort with Python)
    2. Article 7: Compare sorting speeds
      3 min · Learn first: 5, 6 Done. Up next. (Quicksort, Stable sorting and keys)

  4. Proof project

    1. Article 8: Sort a list of records
      2 min · Learn first: 7 Done. Up next. (Compare sorting speeds)

After this trail