Library sort
Bubble sort, or gapped insertion sort is a sorting algorithm much like insertion sort but with gaps left in the sorted array to accelerate subsequent insertions.
 | This computer science article is a stub. You can help Wikipedia by expanding it. |
References
Publication from Los Alamos National Laboratory describing library sort and analyzing its algorithmic complexity.