Insertion Sort is O(n log n)

Michael A. Bender, Martin Farach-Colton, Miguel A. Mosteiro. Insertion Sort is O(n log n). Theory Comput. Syst., 39(3):391-397, 2006. [doi]

Abstract

Abstract is missing.