Algorithms 402: Increasing the efficiency of quicksort

@article{Emden1970Algorithms4I,
  title={Algorithms 402: Increasing the efficiency of quicksort},
  author={M. V. Emden},
  journal={Commun. ACM},
  year={1970},
  volume={13},
  pages={693-694}
}
i n t e g e r p r o c e d u r e eprimes(m, PR, P I ) ; v a l u e m; i n t e g e r m; i n t e g e r array PR, PI ; c o m m e n t The procedure generates the complex prime numbers located in the one-eighth plane defined by 0 < y < x. Any prime found in t h a t area has seven more associated primes: x + yi, x yi, ± y ± xi. These associated primes mus t be genera ted external ly to cprimes. The first complex prime genera ted by cprimes is 1 + i, which exceptional ly lies on x = y and has only three… Expand
Increasing the efficiency of quicksort
TLDR
The main contribution of this paper is another generaization of quicksort, which uses a bounding interval instead of a single element as bound, which turns c,~t to be easy to implement in a computer program. Expand
Computing inversion pair cardinality through partition-based sorting
TLDR
A new randomized, partition-based algorithm for the problem of computing the number of inversion pairs in an unsorted array of n numbers that uses a new inversion pair conserving partition procedure different from existing partition procedures such as Hoare-partitions and Lomuto-partition. Expand
Quicksort algorithms with an early exit for sorted subfiles
TLDR
A new Quicksort algorithms, Qsorte, is presented that provides an early exit for sorted subfiles and results show Q Sorte performs just as well as Quicksorts for random files and in addition has &Ogr;(n) comparisons for sorted or nearly sorted files and &OGr;( n) comparisons in reverse. Expand
Fault Tolerant Sorting—Theoretical and Empirical Analyses of the Randomized QuickMergesort Algorithm
TLDR
The empirical analysis conclusively establishes that RQMS is the algorithm of choice, when fault tolerance is paramount in the application, and measures the “unsortedness” of an array, as characterized by the number of inversion pairs that remain when the sorting algorithm (process) terminates. Expand
Sorting efficiency
  • M. Skaredoff
  • Computer Science, Medicine
  • Journal of Clinical Monitoring
  • 2005
TLDR
The most efficient in memory sort, quicksort, is examined, and the advantages and disadvantages of each variant are discussed in some detail, as well as methods that may enhance speed and resource utilization. Expand
Direct Bulk-Synchronous Parallel Algorithms
TLDR
It is shown that optimality to within a multiplicative factor close to one can be achieved for the problems of Gauss-Jordan elimination and sorting, by transportable algorithms that can be applied for a wide range of values of the parameters p, g, and L. Expand
Implementation of samplesort: A minimal storage tree sort
An implementation of samplesort, a generalization of minimal-storage tree-sorting, is presented as an algorithm which is relatively insensitive to possible non-random permutations of the elements toExpand
Conventional Vs Enhanced Sorting Algorithm: A Review
Sorting problem is one of the most antique problems of computer science. From the beginning of computation, algorithms for sorting problem has been derived and analyzed by many researchers. The firstExpand
An efficient external sorting with minimal space requirement
TLDR
An efficient external sorting algorithm with minimal space requirement is presented, whereN is the number of records in the file to be sorted, andB is the buffer size. Expand
Some performance tests of “quicksort” and descendants
TLDR
Detailed performance evaluations are presented for six ACM algorithms, and quicksort requires the fewest comparisons to sort random arrays and qsort requires many more comparisons than its author claims. Expand
...
1
2
3
...

References

SHOWING 1-8 OF 8 REFERENCES
Algorithm 64: Quicksort
Increasing the efficiency of quicksort
TLDR
The main contribution of this paper is another generaization of quicksort, which uses a bounding interval instead of a single element as bound, which turns c,~t to be easy to implement in a computer program. Expand
Algorithm 271: quickersort
TLDR
The proof for this is established the fact th,~t ttle elimination amounts to prcmultiplying B by a matrix A', a produ(:t of elemerttary matrices, such that A'A is a matrix with ones on r of the diagonal positions and zeros everywhere else. Expand
Algorithm 343: eigenvalues and eigenvectors of a real general matrix
TLDR
This subrout ine finds all the eigenvalues and eigenvectors of a real general matr ix by means of the Qt~ double-step method and the eigenevectors by inverse i tera t ion. Expand
Certification of algorithm 343 [F1]: eigenvalues and eigenvectors of a real general matrix
TLDR
The array W was replaced by an array W which necessitated the removal of the switch list element mu3 from the 8th line, also an alteration to the line before the statement labeled mu3 and the removal from the three lines beginning with the statement labelled mu3. Expand
693] PAUL BRATLEY (Recd. 25 Feb
  • 693] PAUL BRATLEY (Recd. 25 Feb
  • 1970
Cert if icat ion of Algor i thm 343 . Eigenvalues and eigenvectors of a real general matr ix
  • Comm . A C M
  • 1970
Algor i thm 343 , Eigenvalues and eigenvectors of a real general matr ix
  • Comm . A C M
  • 1968