science, integer sorting is the algorithmic problem of sorting a collection of data values by integer keys. Algorithms designed for integer sorting 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...

counting sort is an algorithm for sorting a collection of objects according to keys that are small positive integers; that is, it is an integer sorting algorithm...

sorted lists. Sorting is also often useful for canonicalizing data and for producing human-readable output. Formally, the output of any sorting 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 integer sorting, where all keys are integers. When the keys form a small...

Bead sort, also called gravity sort, is a natural sorting algorithm, developed by Joshua J. Arulanandham, Cristian S. Calude and Michael J. Dinneen in...

not-in-place sorting algorithms The bit space requirement of a pointer is O(log n), but pointer size can be considered a constant in most sorting applications...

Stooge sort is a recursive sorting algorithm. It is notable for its exceptionally poor time complexity of O ( n log ⁡ 3 / log ⁡ 1.5 ) {\displaystyle O(n^{\log...

numbers as the non-negative integers 0, 1, 2, 3, ..., while others start with 1, defining them as the positive integers 1, 2, 3, ... . Some authors acknowledge...

science, merge sort (also commonly spelled as mergesort and as merge-sort) is an efficient, general-purpose, and comparison-based sorting algorithm. Most...

required, or at least valuable, in many algorithms such as binary search, integer sorting, or certain versions of sieve of Eratosthenes. Other data structures...

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...

X + Y {\displaystyle {\boldsymbol {X}}+{\boldsymbol {Y}}} sorting is the problem of sorting pairs of numbers by their sums. Applications of the problem...

a problem such as integer sorting 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...

where they have small enough integer weight to allow integer sorting algorithms such as counting sort or radix sort to sort them in linear time, the disjoint...

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...

integers are to be sorted, although it can slow down sorting significantly. For example, Microsoft Windows does this when sorting file names. Sorting...

word RAM model, integer sorting can be done fairly efficiently. Yijie Han and Mikkel Thorup created a randomized algorithm to sort integers in expected time...

by the sorting step, which requires Θ ( n log ⁡ n ) {\displaystyle \Theta (n\log n)} time using a comparison sort. Even when integer sorting algorithms...

Pancake sorting is the mathematical problem of sorting a disordered stack of pancakes in order of size when a spatula can be inserted at any point in the...

instance, it allows fast integer sorting algorithms, while sorting on the real RAM must be done with slower comparison sorting algorithms. However, some...

In computer science, partial sorting is a relaxed variant of the sorting problem. Total sorting is the problem of returning a list of items such that its...

Kirkpatrick–Reisch sorting is a fast sorting algorithm for items with limited-size integer keys. It is notable for having an asymptotic time complexity...

already sorted, while quicksort would still perform its entire O ( n log ⁡ n ) {\displaystyle O(n\log n)} sorting process. While any sorting algorithm...

allow numbers to be sorted more quickly than O ( n log ⁡ n ) {\displaystyle O(n\log n)} time, for instance by using integer sorting algorithms, planar...

git/tree/lib/sort.c#n205 Linux kernel source Maus, Arne [in Norwegian] (14 May 2014). "Sorting by generating the sorting permutation, and the...

encoding allows one to easily sort them without using floating-point hardware, as if the bits represented sign-magnitude integers, although it is unclear whether...

assumed to be integers, this can be sped up using integer sorting algorithms, to have the same asymptotic running time as the sorting algorithms. For...