Skip to content
Docs

Sorting algorithms

↑

Visualize how an algorithm transforms a small input first. Then compare stable ordering, auxiliary storage and worst-case growth rather than relying only on elapsed timing.

Lessons and practical examples

Section titled “Lessons and practical examples”

  • Insertion sort: Learn the method, test each operation and understand its performance.

  • Merge sort: Learn the method, test each operation and understand its performance.

  • Sorting methods compared: Use the same numbers to compare insertion sort and merge sort.

How to study this section

Section titled “How to study this section”

Start with one concept, work through a small example, and verify your prediction. Follow linked topics when a prerequisite or related idea needs more explanation.