Insertion Sort is O(n log n)
| dc.creator | Bender, Michael A. | |
| dc.creator | Farach-Colton, Martin | |
| dc.creator | Mosteiro, Miguel | |
| dc.date | 2004-07-01 | |
| dc.date.accessioned | 2026-07-07T03:21:31Z | |
| dc.date.available | 2026-07-07T03:21:31Z | |
| dc.description | Traditional Insertion Sort runs in O(n^2) 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. | |
| dc.description | 6 pages, Latex. In Proceedings of the Third International Conference on Fun With Algorithms, FUN 2004 | |
| dc.identifier | https://arxiv.org/abs/cs/0407003 | |
| dc.identifier | http://arxiv.org/abs/cs/0407003 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/32226 | |
| dc.subject | Data Structures and Algorithms | |
| dc.subject | E.5; F.2.2 | |
| dc.title | Insertion Sort is O(n log n) | |
| dc.type | text |