# comparison sort in a sentence

- There are fundamental limits on the performance of
*comparison sorts*. - Since both algorithms it uses are
*comparison sorts*, it too is a comparison sort. - Since both algorithms it uses are comparison sorts, it too is a
*comparison sort*. - This number of memory transfers has been shown to be asymptotically optimal for
*comparison sorts*. - The following table describes integer sorting algorithms and other sorting algorithms that are not
*comparison sorts*. - It's difficult to find
*comparison sort* in a sentence. - It is a
*comparison sort* related to bubble sort, with which it shares many characteristics. - :: Yeah, but bucket sort isn't a
*comparison sort*, but this is. *Comparison sorts* generally adapt more easily to complex orders such as the order of floating-point numbers.- The article claims to be about a
*comparison sort* with runtime O ( n log log n )! - In many large applications needing speed, the computer radix sort is an improvement on ( slower )
*comparison sorts*. - A metaphor for thinking about
*comparison sorts* is that someone has a set of unlabelled weights and a balance scale. - In every pass, the
*comparison sort* moves a key to another place a certain distance ( a path length ). - Hence \ ln n ! \ sim n \ ln n ( see computational complexity of sorting algorithms ( see
*comparison sort* ). - Using such a tree, the algorithm has an worst-case performance, thus being degree-optimal for a
*comparison sort*. - Shellsort, discovered by Donald Shell in 1959, is a
*comparison sort* which divides a list to be sorted into sublists and sorts them separately.