Sorting - Insertion Sort

Lesson overview

Topics covered: building sorted array one element at a time.

Sorting Algorithms

Comparison-based sorting, bubble sort compares adjacent elements
Selection sort finds minimum and swaps
Insertion sort builds sorted array one element at a time
Time complexity: O(n²) for simple sorts, O(n log n) for quicksort/mergesort

Article author: Arthur Isaev