A survey of adaptive sorting algorithms

@article{EstivillCastro1992ASO,
  title={A survey of adaptive sorting algorithms},
  author={Vladimir Estivill-Castro and Derick Wood},
  journal={ACM Comput. Surv.},
  year={1992},
  volume={24},
  pages={441-476}
}
The design and analysis of adaptive sorting algorithms has made important contributions to both theory and practice. The main contributions from the theoretical point of view are: the description of the complexity of a sorting algorithm not only in terms of the size of a problem instance but also in terms of the disorder of the given problem instance; the establishment of new relationships among measures of disorder; the introduction of new sorting algorithms that take advantage of the existing… Expand
An Adaptive Generic Sorting Algorithm that Uses
A sorting algorithm is adaptive if its run time, for inputs of the same size n, varies smoothly from O(n) to O(n logn) as the disorder of the input varies. It is well accepted that les that areExpand
An adaptive generic sorting algorithm that uses variable partitioning
TLDR
This work presents Partition Sort, a new generic sorting algorithm for which wi: can establish adaptivity, based on divide-and-conquer in which the number of subproblem!r i t each level of recursion depends on the disorder of the input. Expand
Sorting by Merging or Merging by Sorting?
TLDR
This work proves the existence of an algorithm that, for any set of s ≤n sorted sequences containing a total of n elements, computes the whole sorted sequence using O( nlogs) comparisons, O(n) data moves and O(1) auxiliary cells of memory besides the ones necessary for the n input elements. Expand
A UNIQUE SORTING ALGORITHM WITH LINEAR TIME & SPACE COMPLEXITY
TLDR
The presented approach is to sort a list with linear time and space complexity using divide and conquer rule by partitioning a problem into n (input size) number of sub problems then these sub problems are solved recursively. Expand
Algorithm selection for sorting and probabilistic inference: a machine learning-based approach
The algorithm selection problem aims at selecting the best algorithm for a given computational problem instance according to some characteristics of the instance. In this dissertation, we firstExpand
A General Method for Improving Insertion-Based Adaptive Sorting
TLDR
A new natural measure of presortedness is introduced, which is a composition of two existing ones: Block that gives the number of already sorted disjoint subsequences of the input, and Loc defined as \(\prod^{n}_{i=2} d_i\), where d i denotes the distance between the (i − 1)th and the ith element of theinput in the ordered sequence up to the itH element. Expand
Three Sorting Algorithms Using Priority Queues
TLDR
A lower bound is established on the number of comparisons performed by any algorithm that uses priority queues to sort n elements; it is shown that this algorithm sorts an already sorted sequence in linear time; a fact that is not obvious since there is no special checks to guarantee this behavior. Expand
Adaptive ( Analysis of ) Algorithms for Convex Hulls and Related Problems
Adaptive analysis is a well known technique in computational geometry, which re nes the traditional worst case analysis over all instances of xed input size by taking into account some otherExpand
Sorting N-Elements Using Natural Order: A New Adaptive Sorting Approach
TLDR
A new method on natural sorting algorithm with a run time for n input data O( n) to O(nlogm), where m defines a positive value and surrounded by 50% of n, indicating that the method uses less time as well as acceptable memory to sort a data sequence considering the natural order behavior. Expand
Alternative Measures for the Analysis of Online Algorithms
TLDR
It is shown that LRU is the unique optimal online paging algorithm according to Average Analysis on sequences with locality of reference, and this thesis is the first systematic application of this technique to the study of online algorithms. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 97 REFERENCES
On partitions and presortedness of sequences
TLDR
An optimal algorithm for sorting multisets and for finding the multiset sizes as well is derived and some sorting strategies that are optimal with respect to these measures of presortedness are presented. Expand
A Framework for Adaptive Sorting
TLDR
It is shown that there exists a natural partial order on the set of measures, which makes it possible to say that some measures are superior to others, and insert all known measures of presortedness into the partial order, and thereby provide a powerful tool for evaluating both measures and adaptive sorting algorithms. Expand
Randomized Adative Sorting
TLDR
This work investigates three randomized algorithms, the first time randomization has been used to obtain adaptive sorting algorithms, and claims about the performance of adaptive variants of Quicksort are based on a formal analysis. Expand
Sorting and measures of disorder
It has been observed that, in practice, sequences to be sorted are often nearly sorted. Nearly sorted or presorted sequences are regarded as easier instances of the sorting problem and sortingExpand
Practical Adaptive Sorting
TLDR
A practical adaptive sorting algorithm, optimal with respect to five important measures of presortedness and smoothly adaptive from O( n) to O(n log n) time for other common measures is obtained. Expand
Samplesort: A Sampling Approach to Minimal Storage Tree Sorting
TLDR
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. Expand
Parallel Sorting Algorithms
TLDR
The chapter presents a unified treatment of various parallel sorting algorithms by bringing out clearly the relation between the architecture of parallel computers and the structure of algorithms. Expand
An Optimal Parallel Adaptive Sorting Algorithm
TLDR
An adaptive parallel sorting algorithm is presented, which sorts a sequence X of length n in O(logn·log Runs(X) time by using O ( n log n ) processors in the EREW PRAM model of computation. Expand
Sorting, Trees, and Measures of Order
  • W. Burge
  • Computer Science, Mathematics
  • Inf. Control.
  • 1958
TLDR
This paper analyses the best methods of sorting on a digital computer using two main types, “sorting by merging” and “distribution sorting”, and a minimal tree is constructed giving the best strategy. Expand
Probabilistic computations: Toward a unified measure of complexity
  • A. Yao
  • Computer Science
  • 18th Annual Symposium on Foundations of Computer Science (sfcs 1977)
  • 1977
TLDR
Two approaches to the study of expected running time of algoritruns lead naturally to two different definitions of intrinsic complexity of a problem, which are the distributional complexity and the randomized complexity, respectively. Expand
...
1
2
3
4
5
...