INSERTION SORT is O(n log n) (2004)
Cached
Download Links
by
Michael A. Bender
,
Martín Farach-Colton
,
Miguel Mosteiro
| Citations: | 1 - 1 self |
BibTeX
@MISC{Bender04insertionsort,
author = {Michael A. Bender and Martín Farach-Colton and Miguel Mosteiro},
title = {INSERTION SORT is O(n log n)},
year = {2004}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Traditional INSERTION SORT runs in O(n²) time because each insertion takes O(n) time. When people run INSERTION SORT in the physical world, they leave gaps between items to accelerate insertions. Gaps help in computers as well. This paper shows that GAPPED INSERTION SORT has insertion times of O(log n) with high probability, yielding a total running time of O(n log n) with high probability.
Citations
| 119 | Cache-oblivious B-trees - BENDER, DEMAINE, et al. - 2000 |
| 65 | A locality-preserving cache-oblivious dynamic dictionary - Bender, Duan, et al. - 2004 |
| 43 | M.: A sparse table implementation of priority queues - Itai, Konheim, et al. - 1981 |
| 7 | Cache-oblivious search trees via binary trees of small height - Brodal, Fagerberg, et al. - 2002 |
| 6 | Controlled density sorting - Melville, Gries - 1980 |
| 2 | An in-place sorting algorithm performing O(n log n) comparisons and O(n) data moves - Franceschini - 2003 |
