Skip to main content
Conference Proceedings

Sorting presorted files

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1979) 67 LNCS 199-212
DOI: 10.1007/3-540-09118-1_22
44Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A new sorting algorithm is presented. Its running time is O(n(1+log(F/n)) where F=|{(i,j); i

Cite

CITATION STYLE

APA

Mehlhorn, K. (1979). Sorting presorted files. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 67 LNCS, pp. 199–212). Springer Verlag. https://doi.org/10.1007/3-540-09118-1_22

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free