high times people people people people

Insertion Sort is O(n log n)

research

Traditional Insertion Sort runs in O(n^2) time because each insertion takes O(n) time. When people run Insertion Sort in the