> n log n? From the article: Digging into the source code of std::sort() we can see that it uses Insertion Sort for short collections. Our 32-element vector fa

> n log n? From the article: Digging into the source code of std::sort() we can see that it uses Insertion Sort for short collections. Our 32-element vector falls under the threshold. Insertion Sort makes O(N^2) comparisons > arent . .. entries always at the beginning of the list? No.