Journal ArticleDOI
A guided bibliography to sorting
TLDR
This bibliography attempts to help the reader select from the rich body of sorting literatrue that which is in accord with his interests, needs, and prior training.Abstract:
This bibliography attempts to help the reader select from the rich body of sorting literatrue that which is in accord with his interests, needs, and prior training.
Historical trends within the field are briefly outlined, and subspecialties are identified. Critical comments and classification of the cited works are intended to help the reader to avoid wasted effort.read more
Citations
More filters
Journal ArticleDOI
An Algorithm to Dualize a Regular Switching Function
Peled,Pollatschek +1 more
TL;DR: An algorithm is presented to compute the roofs of the dual Boolean function Fd= F̄(x̄) this computation is needed, for example, in the synthesis problem of threshold logic.
Book ChapterDOI
Data Organization and Access Methods
TL;DR: Over the past 15 years there has been a trend in computer applications programming from highly structured programs and loosely structured data toward loosely structured Programs and highly structured data, made possible by the transition from magnetic tape as a secondary storage medium to direct access mass storage media and large-scale drums.
Book ChapterDOI
Algorithms and Data Structures
TL;DR: Much of the following discussion in this work relies on standard tools from computational geometry, approximation theory, and computer programming, which helps to keep this work widely self-contained.
Journal Article
Root to Fruit (1): An Evolutionary Study of Sorting Problem
Pramod Kadam,Sachin Kadam +1 more
TL;DR: Initial thought is provided for why should do evolutionary study in computer science and in sorting algorithmic domain and list of literatures which can help during this evolutionary study of sorting algorithms.
References
More filters
Journal ArticleDOI
A high-speed sorting procedure
TL;DR: It is highly desirable to have a method with the speed characteristics of the merging by pairs and the space characteristics of sifting, if such a method were available, to sort twice as many items at one time in the machine and still do it at a reasonably high speed.
Journal ArticleDOI
Samplesort: A Sampling Approach to Minimal Storage Tree Sorting
W. D. Frazer,A. C. McKellar +1 more
TL;DR: A procedure is proposed which is a generalization of minimal storage tree sorting and which has the following three properties: there is a significant improvement in the expected number of comparisons required to sort the input sequence, the procedure is statistically insensitive to bias in theinput sequence, and the expected numbers of comparisons approaches the information-theoretic lower bound on the number of compared required.
Journal ArticleDOI
Some Combinatorial Properties of Certain Trees With Applications to Searching and Sorting
TL;DR: This paper introduces an abstract entity, the binary search tree, and exhibits some of its properties, which are relevant to processes occurring in stored program computers-in particular, to search processes.
Journal ArticleDOI
Algorithm 347: an efficient algorithm for sorting with minimal storage [M1]
TL;DR: The real procedure gauss computes the area under the left-hand portion of the normal curve by using National Bureau of Standards formulas 26.6.4, 26.5, and 26.8 for computation of the statistic and the approximation for the approximation.