Bender, M. A.; Farach-Colton, M. & Mosteiro, M. A. (2006), 'Insertion Sort is O(n log n)', Theory of Computing Systems 39 (3), 391-397.