Bender2004

CREATED: 201004091828 LINK: url:~/Modules/Literature/Bender2004.pdf

Gapped insertion sort has insertion times of O(lg n) with high prob, yielding a total running time of O(n lg n)