Search results

===Comparison to other linear sorts=== ...

{{short description|Comparison-based sorting algorithm}} ...emory transfers has been shown to be asymptotically optimal for comparison sorts. This distribution sort also achieves the asymptotically optimal runtime co ...

===Comparison to other linear sorts=== ...

{{Short description|Comparison sorting algorithm}} ...place, [[Sorting algorithm#Stability|unstable]] [[sorting algorithm]], a [[comparison sort]] that is theoretically optimal in terms of the total number of writes ...

...of numbers introduced in 1950 by [[Hugo Steinhaus]] for the analysis of [[comparison sort]] algorithms. These numbers give the [[Worst-case complexity|worst-cas ...imum number of comparisons needed to sort <math>n</math> items using any [[comparison sort]]. The conjecture was disproved in 1959 by [[L. R. Ford Jr.]] and [[Se ...

{{Short description|Type of comparison sorting algorithm}} ...e]], '''merge-insertion sort''' or the '''Ford–Johnson algorithm''' is a [[comparison sort]]ing algorithm published in 1959 by [[L. R. Ford Jr.]] and [[Selmer M. ...

'''Funnelsort''' is a [[comparison sort|comparison-based]] [[sorting algorithm]]. It is similar to [[mergesort]], but it is a ...y transfers has been shown to be [[asymptotically optimal]] for comparison sorts. Funnelsort also achieves the asymptotically optimal runtime complexity of ...

[[File:Bucket sort 2.png|right|frame|Unlike bucket sorting which sorts after all the buckets are filled, the elements are [[insertion sort]]ed as ...a items, or keys, into a number of "subarrays" (termed buckets, in similar sorts). The name is short for computing a "proximity map," which indicates for ea ...

...ms are equal): either <math>a < b</math> or <math>a > b</math>. Comparison sorts can be expressed as decision trees in this model, since such sorting algori ==Comparison trees and lower bounds for sorting== ...

Knuth observed that this algorithm correctly sorts some input sequences, and fails to sort others. For instance, the sequence ...length. Knuth characterized the permutations that this algorithm correctly sorts as being exactly the permutations that do not contain the [[permutation pat ...

...tion, [[VLSI]] design, and [[sparse polynomial]] multiplication. As with [[comparison sort]]ing and [[integer sorting]] more generally, algorithms for this probl It is unknown whether this problem has a comparison-based solution whose running time is [[asymptotic analysis|asymptotically]] ...

...meaning that the list has become fully sorted. The algorithm, which is a [[comparison sort]], is named for the way the larger elements "bubble" up to the top of However, if parallel processing is allowed, bubble sort sorts in O(n) time, making it considerably faster than parallel implementations o ...

To simulate each comparison, the parametric search applies a second algorithm, a ''decision algorithm'' ...algorithm. However, many applications use other test algorithms (often, [[comparison sort]]ing algorithms). Advanced versions of the parametric search technique ...

Like Timsort, Powersort is a [[Sorting_algorithm#Stability|stable]] sort and comparison-based. == Comparison with Timsort == ...

...des its data into buckets accordingly. Like quicksort, it then recursively sorts the buckets. .../math> gets the local buckets <math>b_i</math> of all other processors and sorts these locally. The distribution takes <math>T_\text{all-to-all}(N, p)</math ...

'''Timsort''' is a [[hybrid algorithm|hybrid]], [[:Category:stable sorts|stable]] [[sorting algorithm]], derived from [[merge sort]] and [[insertion ...ts of the smaller array (X in this illustration) to temporary memory, then sorts and fills elements in final order into the combined space of X and Y.]] ...

...was the first advance in this problem in four decades. In every pass, the comparison sort moves a key to another place a certain distance (a path length). All t ==Comparison with other methods== ...

...sed to sort the contents of the second internal buffer, including unstable sorts like [[quicksort]], since the contents of the buffer are guaranteed to be u [[Category:Comparison sorts]] ...

This sediment transport sorts grain sizes based on the velocity. As stream competence increases, the [[Pa ...ncreases above a threshold and starts the process of sediment transport. A comparison of the flow strength available during a given discharge to the critical she ...

...ions, such as translations, it is very nontrivial to accommodate for other sorts of transformations, such as 3D rotations and changing facial expressions. M ...t classification accuracy and decreases the number of training examples in comparison with standard spectral and cepstral features for an acoustic classification ...