INSERTION SORT is O(n log n)

Theory of Computing Systems

Volumn 39, Issue 3, 2006, Pages 391-397

  Bender, Michael A ^a   Farach Colton, Martín ^b   Mosteiro, Miguel A ^b  

^a USA   (United States)

^b RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

HIGH PROBABILITY; PHYSICAL WORLD; RUNNING TIME;

MATHEMATICAL TECHNIQUES;

COMPUTER SCIENCE;

EID: 33646490751     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s00224-005-1237-z     Document Type: Conference Paper

References (7)

1. M. A. Bender, E. D. Demaine, and M. Farach-Colton. Cache-oblivious B-trees. In Proc. 41st IEEE Ann. Symp. on Foundations of Computer Science, pages 399-409, 2000.
2. M. A. Bender, Z. Duan, J. Iacono, and J. Wu. A locality-preserving cache-oblivious dynamic dictionary. In Proc. 13th ACM-SIAM Ann. Symp. on Discrete Algorithms, pages 29-38, 2002.
3. G. S. Brodal, R. Fagerberg, and R. Jacob. Cache-oblivious search trees via binary trees of small height. In Proc. 13th ACM-SIAM Ann. Symp. on Discrete Algorithms, pages 39-48, 2002.
4. W. Feller. Stirling's formula. In An Introduction to Probability Theory and Its Applications, Vol. 1, 3rd edn., II.9, Wiley, New York, pages 50-53, 1968.
5. G. Franceschini. An in-place sorting algorithm performing O(n log n) comparisons and O(n) data moves. In Proc. 44th IEEE Ann. Symp. on Foundations of Computer Science, pages 242-250, 2003.
6. A. Itai, A. G. Konheim, and M. Rodeh. A sparse table implementation of priority queues. In Proc. 8th EATCS Int. Colloq. on Automata, Languages and Programming, pages 417-431, 1981.
7. R. Melville and D. Gries. Controlled density sorting. In Information Processing Letters, 10(4):169-172, 1980.