Book Chapter10.1007/3-540-09118-1_22
Sorting Presorted Files
TL;DR: A new sorting algorithm is presented whose running time is O(n(1+log(F/n)) where F=|{(i,j); i<j and xi<xj}.
read more
About: This article is published in Theoretical Computer Science. The article was published on 26 Mar 1979.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
A survey of adaptive sorting algorithms
TL;DR: This survey presents the basic notions and concepts of adaptive sorting, the demonstration that several algorithms currently in use are adaptive, and the development of new algorithms, similar to currently used algorithms that perform competitively on random sequences and are significantly faster on nearly sorted sequences.
260
Measures of Presortedness and Optimal Sorting Algorithms
TL;DR: The concept of presortedness and its use in sorting is studied, and a new insertion sort algorithm is shown to be optimal with respect to three natural measures.
143
Compressed representations of permutations, and applications
Jérémy Barbay,Gonzalo Navarro +1 more
- 26 Feb 2009
TL;DR: Various techniques to compress a permutation over n integers, taking advantage of ordered subsequences in �, while supporting its application �(i) and the application of its inverse � −1 (i) in small time are explored.
Efficient Fully-Compressed Sequence Representations
TL;DR: This work achieves compressed redundancy, retaining the best time complexities, for the smallest existing full-text self-indexes; compressed permutations π with times for π() and π−1() improved to loglogarithmic; and the first compressed representation of dynamic collections of disjoint sets.
58
A simple linear-time algorithm for in situ merging
Heikki Mannila,Esko Ukkonen +1 more
TL;DR: The algorithm is developed by first finding an intuitively clear divide-and-conquer algorithm with sublinear workspace, and then removing the workspace.
48
References
•Book
The Design and Analysis of Computer Algorithms
Alfred V. Aho,John E. Hopcroft +1 more
- 01 Jan 1974
TL;DR: This text introduces the basic data structures and programming techniques often used in efficient algorithms, and covers use of lists, push-down stacks, queues, trees, and graphs.
10.6K
Organization and maintenance of large ordered indexes
Rudolf Bayer,Edward M. McCreight +1 more
TL;DR: In this paper, the index is maintained with an average of 9 (at least 4) transactions per second on an IBM 360/44 with a 2311 disc and the index pages are organized in a special datastructure, so-called B-trees.
1.3K
An algorithm for the organization of information
M. AdelsonVelskii
- 14 Jan 1963
TL;DR: The organization of information placed in the points of an automatic computer is discussed and the role of memory, storage and retrieval in this regard is discussed.
976
Organization and maintenance of large ordered indices
Rudolf Bayer,E. McCreight +1 more
- 15 Nov 1970
TL;DR: The index organization described allows retrieval, insertion, and deletion of keys in time proportional to logk I where I is the size of the index and k is a device dependent natural number such that the performance of the scheme becomes near optimal.