In computer science, integer sorting is the algorithmic problem of sorting a collection of data values by integer keys. Algorithms designed for integer sorting may also often be applied to sorting problems in which the keys are floating point numbers, rational numbers, or text strings.[1] The ability to perform integer arithmetic on the keys allows integer sorting algorithms to be faster than comparison sorting algorithms in many cases, depending on the details of which operations are allowed in the model of computing and how large the integers to be sorted are.
Integer sorting algorithms including pigeonhole sort, counting sort, and radix sort are widely used and practical. Other integer sorting algorithms with smaller worst-case time bounds are not believed to be practical for computer architectures with 64 or fewer bits per word. Many such algorithms are known, with performance depending on a combination of the number of items to be sorted, number of bits per key, and number of bits per word of the computer performing the sorting algorithm.
science, integersorting is the algorithmic problem of sorting a collection of data values by integer keys. Algorithms designed for integersorting may also...
most suitable for sorting strings or fixed-length integer representations. A sequence like [b, c, e, d, f, g, ba] would be sorted as [b, ba, c, d, e...
sorts. A comparison sort cannot perform better than O(n log n) on average. The following table describes integersorting algorithms and other sorting...
counting sort is an algorithm for sorting a collection of objects according to keys that are small positive integers; that is, it is an integersorting algorithm...
1961. It is still a commonly used algorithm for sorting. Overall, it is slightly faster than merge sort and heapsort for randomized data, particularly...
log n) bound for comparison sorting by using non-comparison sorts; an example is integersorting, where all keys are integers. When the keys form a small...
computer science, merge sort (also commonly spelled as mergesort) is an efficient, general-purpose, and comparison-based sorting algorithm. Most implementations...
required, or at least valuable, in many algorithms such as binary search, integersorting, or certain versions of sieve of Eratosthenes. Other data structures...
Bead sort, also called gravity sort, is a natural sorting algorithm, developed by Joshua J. Arulanandham, Cristian S. Calude and Michael J. Dinneen in...
word RAM model, integersorting can be done fairly efficiently. Yijie Han and Mikkel Thorup created a randomized algorithm to sortintegers in expected time...
assumed to be integers, this can be sped up using integersorting algorithms, to have the same asymptotic running time as the sorting algorithms. For...
Stooge sort is a recursive sorting algorithm. It is notable for its exceptionally bad time complexity of O ( n log 3 / log 1.5 ) {\displaystyle O(n^{\log...
In computer science, bogosort (also known as permutation sort and stupid sort) is a sorting algorithm based on the generate and test paradigm. The function...
Shell sort or Shell's method, is an in-place comparison sort. It can be seen as either a generalization of sorting by exchange (bubble sort) or sorting by...
Block sort, or block merge sort, is a sorting algorithm combining at least two merge operations with an insertion sort to arrive at O(n log n) (see Big...
already sorted, while quicksort would still perform its entire O ( n log n ) {\displaystyle O(n\log n)} sorting process. While any sorting algorithm...
a problem such as integersorting in which there are n integers to be sorted, the transdichotomous model assumes that each integer may be stored in a...
This is a list of notable integer sequences with links to their entries in the On-Line Encyclopedia of Integer Sequences. OEIS core sequences Index to...
instance, it allows fast integersorting algorithms, while sorting on the real RAM must be done with slower comparison sorting algorithms. However, some...
natural numbers as the non-negative integers 0, 1, 2, 3, ..., while others define them as the positive integers 1, 2, 3, .... Some authors acknowledge...
different sorting algorithm, or by recursively applying the bucket sorting algorithm. It is a distribution sort, a generalization of pigeonhole sort that allows...
arithmetic that allow numbers to be sorted more quickly than O(n log n) time, for instance by using integersorting algorithms, planar convex hulls can...
flag sort is an efficient, in-place variant of radix sort that distributes items into buckets. Non-comparative sorting algorithms such as radix sort and...
problems like integersorting. The problem consists of maintaining a set S, which contains a subset of U integers. Each of these integers can be stored...
{\displaystyle O(n(1+{\tfrac {\log N}{\log n}}))} by radix sorting. However, it was assumed that integersorting algorithms would necessarily have a time bound depending...
Global Information