%0 Generic %1 Bender_insertionsort %A Bender, Michael A. %A Farach colton, Martín %A Mosteiro, Miguel %D ? %K 2012 insertion kde seminar sort %T INSERTION SORT is O(n log n) %U http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.163.5059 %X 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. 1.

@misc{Bender_insertionsort, abstract = {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. 1.}, added-at = {2012-06-15T16:50:02.000+0200}, author = {Bender, Michael A. and Farach colton, Martín and Mosteiro, Miguel}, biburl = {https://www.bibsonomy.org/bibtex/2bfc69d051af8ce9e92f380e194054966/lenz}, description = {CiteSeerX — INSERTION SORT is O(n log n)}, interhash = {c14e3945a3172b2b75fe40a046730504}, intrahash = {bfc69d051af8ce9e92f380e194054966}, keywords = {2012 insertion kde seminar sort}, timestamp = {2012-06-15T16:50:02.000+0200}, title = {INSERTION SORT is O(n log n)}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.163.5059}, year = {?} }