Insertion Sort is O(n log n)

What this record says

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

CATALOG · The abstract is indexed.