8. Integer and Distribution Sorting

Non-comparison sorts: counting, radix, and bucket sort families, string sorting, and suffix array construction.

40 items

8. Integer and distribution sorting, 40

index slug name
216 counting-sort Counting Sort
217 stable-counting-sort Stable Counting Sort
218 key-indexed-counting Key Indexed Counting
219 radix-sort Radix Sort
220 lsd-radix-sort LSD Radix Sort
221 msd-radix-sort MSD Radix Sort
222 american-flag-sort American Flag Sort
223 in-place-radix-sort In Place Radix Sort
224 binary-radix-sort Binary Radix Sort
225 burstsort Burstsort
226 bucket-sort Bucket Sort
227 uniform-bucket-sort Uniform Bucket Sort
228 histogram-sort Histogram Sort
229 pigeonhole-sort Pigeonhole Sort
230 flashsort Flashsort
231 spreadsort Spreadsort
232 burstsort-string-sorting Burstsort String Sorting
233 radix-exchange-sort Radix Exchange Sort
234 ska-sort Ska Sort
235 ips4o IPS4o
236 integer-sample-sort Integer Sample Sort
237 word-radix-sort Word Radix Sort
238 bytewise-radix-sort Bytewise Radix Sort
239 most-significant-byte-sort Most Significant Byte Sort
240 least-significant-byte-sort Least Significant Byte Sort
241 american-flag-string-sort American Flag String Sort
242 multikey-quicksort Multikey Quicksort
243 three-way-string-quicksort Three Way String Quicksort
244 suffix-array-doubling-sort Suffix Array Doubling Sort
245 suffix-array-radix-sort Suffix Array Radix Sort
246 induced-sorting Induced Sorting
247 sais SA IS
248 skew-suffix-array-sort Skew Suffix Array Sort
249 dc3-suffix-array-sort DC3 Suffix Array Sort
250 dc7-suffix-array-sort DC7 Suffix Array Sort
251 counting-sort-negative-keys Counting Sort with Negative Keys
252 coordinate-compression-sort Coordinate Compression Sort
253 sparse-key-counting-sort Sparse Key Counting Sort
254 radix-sort-floating-point Floating Point Radix Sort
255 signed-integer-radix-sort Signed Integer Radix Sort
Wiki › Algorithms › 01. Searching and Sorting › 8. Integer and Distribution Sorting ›

Counting Sort

Sort integers by counting occurrences of each key and reconstructing the output in linear time.
algorithms sorting counting-sort integer-sorting
Wiki › Algorithms › 01. Searching and Sorting › 8. Integer and Distribution Sorting ›

Stable Counting Sort

Stable variant of counting sort using prefix sums to preserve relative order of equal keys.
algorithms sorting counting-sort stable-sorting
Wiki › Algorithms › 01. Searching and Sorting › 8. Integer and Distribution Sorting ›

Key Indexed Counting

Counting-based stable sorting technique that maps keys to index ranges using frequency and prefix sums.
algorithms sorting counting-sort key-indexed-counting
Wiki › Algorithms › 01. Searching and Sorting › 8. Integer and Distribution Sorting ›

Radix Sort

Sort integer or string keys by processing one digit, byte, or character position at a time.
algorithms sorting radix-sort integer-sorting
Wiki › Algorithms › 01. Searching and Sorting › 8. Integer and Distribution Sorting ›

LSD Radix Sort

Sort fixed width keys by processing digits from least significant to most significant using a stable inner sort.
algorithms sorting radix-sort lsd-radix-sort
Wiki › Algorithms › 01. Searching and Sorting › 8. Integer and Distribution Sorting ›

MSD Radix Sort

Sort keys by processing the most significant digit first and recursively sorting subarrays.
algorithms sorting radix-sort msd-radix-sort
Wiki › Algorithms › 01. Searching and Sorting › 8. Integer and Distribution Sorting ›

American Flag Sort

In place radix sort that partitions elements by digit using cycle leader permutation.
algorithms sorting radix-sort american-flag-sort
Wiki › Algorithms › 01. Searching and Sorting › 8. Integer and Distribution Sorting ›

In Place Radix Sort

Sort digit based keys by redistributing elements inside the original array with only small auxiliary bucket state.
algorithms sorting radix-sort in-place-sorting
Wiki › Algorithms › 01. Searching and Sorting › 8. Integer and Distribution Sorting ›

Binary Radix Sort

Sort integers by processing bits directly using partitioning instead of counting arrays.
algorithms sorting radix-sort binary-radix-sort
Wiki › Algorithms › 01. Searching and Sorting › 8. Integer and Distribution Sorting ›

Burstsort

Cache efficient string sorting algorithm that builds a trie and sorts buckets lazily for high performance on large text data.
algorithms sorting string-sorting burstsort
Wiki › Algorithms › 01. Searching and Sorting › 8. Integer and Distribution Sorting ›

Bucket Sort

Distribute elements into buckets based on value ranges and sort each bucket independently.
algorithms sorting distribution-sorting bucket-sort
Wiki › Algorithms › 01. Searching and Sorting › 8. Integer and Distribution Sorting ›

Uniform Bucket Sort

Bucket sort variant that assumes uniform distribution and uses equal-width buckets with simple mapping.
algorithms sorting distribution-sorting bucket-sort
Wiki › Algorithms › 01. Searching and Sorting › 8. Integer and Distribution Sorting ›

Histogram Sort

Sort elements by building a frequency histogram and reconstructing the output from cumulative counts.
algorithms sorting distribution-sorting histogram-sort
Wiki › Algorithms › 01. Searching and Sorting › 8. Integer and Distribution Sorting ›

Pigeonhole Sort

Sort integer keys by placing each value into a direct address slot over a small contiguous range.
algorithms sorting distribution-sorting pigeonhole-sort
Wiki › Algorithms › 01. Searching and Sorting › 8. Integer and Distribution Sorting ›

Flashsort

Distribution sorting algorithm that approximates uniform distribution and then refines with insertion sort.
algorithms sorting distribution-sorting flashsort
Wiki › Algorithms › 01. Searching and Sorting › 8. Integer and Distribution Sorting ›

Spreadsort

Hybrid distribution and comparison sort that adapts between radix-like partitioning and comparison sorting.
algorithms sorting distribution-sorting spreadsort
Wiki › Algorithms › 01. Searching and Sorting › 8. Integer and Distribution Sorting ›

Burstsort String Sorting

String sorting method that groups strings by prefixes in a trie and sorts leaf buckets for cache efficient lexicographic order.
algorithms sorting string-sorting burstsort
Wiki › Algorithms › 01. Searching and Sorting › 8. Integer and Distribution Sorting ›

Radix Exchange Sort

In place binary radix sort that partitions keys by bits from most significant to least significant.
algorithms sorting radix-sort radix-exchange-sort
Wiki › Algorithms › 01. Searching and Sorting › 8. Integer and Distribution Sorting ›

Ska Sort

High performance radix sort variant using cache friendly block partitioning and branchless techniques.
algorithms sorting radix-sort ska-sort
Wiki › Algorithms › 01. Searching and Sorting › 8. Integer and Distribution Sorting ›

IPS4o

In-place parallel super scalar samplesort for high performance comparison sorting on modern multicore machines.
algorithms sorting parallel-sorting samplesort in-place-sorting
Wiki › Algorithms › 01. Searching and Sorting › 8. Integer and Distribution Sorting ›

Integer Sample Sort

Sample sort specialized for integer keys using range-based partitioning and optional radix-style bucket classification.
algorithms sorting sample-sort integer-sorting
Wiki › Algorithms › 01. Searching and Sorting › 8. Integer and Distribution Sorting ›

Word Radix Sort

Radix sort specialized for fixed-width machine words using byte or bit extraction for high throughput.
algorithms sorting radix-sort word-radix-sort
Wiki › Algorithms › 01. Searching and Sorting › 8. Integer and Distribution Sorting ›

Bytewise Radix Sort

Radix sort that processes fixed-width keys one byte at a time using 256 counting buckets.
algorithms sorting radix-sort bytewise-radix-sort
Wiki › Algorithms › 01. Searching and Sorting › 8. Integer and Distribution Sorting ›

Most Significant Byte Sort

MSD radix sort variant that partitions keys by the most significant byte and recursively sorts subarrays.
algorithms sorting radix-sort msb-sort
Wiki › Algorithms › 01. Searching and Sorting › 8. Integer and Distribution Sorting ›

Least Significant Byte Sort

LSD radix sort variant that processes keys byte by byte from least significant to most significant.
algorithms sorting radix-sort lsb-sort
Wiki › Algorithms › 01. Searching and Sorting › 8. Integer and Distribution Sorting ›

American Flag String Sort

In-place MSD radix string sort that partitions strings by character using American flag style bucket permutation.
algorithms sorting string-sorting radix-sort american-flag-sort
Wiki › Algorithms › 01. Searching and Sorting › 8. Integer and Distribution Sorting ›

Multikey Quicksort

String sorting algorithm that partitions strings by the character at the current depth using three-way quicksort.
algorithms sorting string-sorting quicksort
Wiki › Algorithms › 01. Searching and Sorting › 8. Integer and Distribution Sorting ›

Three Way String Quicksort

String sorting algorithm that uses three-way partitioning on characters to efficiently handle repeated prefixes.
algorithms sorting string-sorting quicksort
Wiki › Algorithms › 01. Searching and Sorting › 8. Integer and Distribution Sorting ›

Suffix Array Doubling Sort

Construct a suffix array by iteratively sorting suffixes using doubling technique with rank pairs.
algorithms sorting string-processing suffix-array
Wiki › Algorithms › 01. Searching and Sorting › 8. Integer and Distribution Sorting ›

Suffix Array Radix Sort

Construct a suffix array by sorting rank pairs with radix or counting sort during the doubling method.
algorithms sorting string-processing suffix-array radix-sort
Wiki › Algorithms › 01. Searching and Sorting › 8. Integer and Distribution Sorting ›

Induced Sorting

Linear-time technique for suffix array construction that induces order of suffixes from a subset of sorted suffixes.
algorithms sorting string-processing suffix-array induced-sorting
Wiki › Algorithms › 01. Searching and Sorting › 8. Integer and Distribution Sorting ›

SA IS

Linear-time suffix array construction algorithm based on induced sorting of LMS suffixes.
algorithms sorting string-processing suffix-array sa-is
Wiki › Algorithms › 01. Searching and Sorting › 8. Integer and Distribution Sorting ›

Skew Suffix Array Sort

Linear-time suffix array construction using the DC3 algorithm that recursively sorts positions modulo 3.
algorithms sorting string-processing suffix-array dc3
Wiki › Algorithms › 01. Searching and Sorting › 8. Integer and Distribution Sorting ›

DC3 Suffix Array Sort

Difference cover modulo 3 algorithm for linear-time suffix array construction using radix sorting and merging.
algorithms sorting string-processing suffix-array dc3
Wiki › Algorithms › 01. Searching and Sorting › 8. Integer and Distribution Sorting ›

DC7 Suffix Array Sort

Difference cover modulo 7 suffix array construction method that generalizes DC3 with a larger recursive sample.
algorithms sorting string-processing suffix-array dc7
Wiki › Algorithms › 01. Searching and Sorting › 8. Integer and Distribution Sorting ›

Counting Sort with Negative Keys

Extend counting sort to handle negative integers by shifting keys into a nonnegative index range.
algorithms sorting counting-sort integer-sorting
Wiki › Algorithms › 01. Searching and Sorting › 8. Integer and Distribution Sorting ›

Coordinate Compression Sort

Sort values by mapping them to a dense rank space and ordering by compressed indices.
algorithms sorting coordinate-compression integer-sorting
Wiki › Algorithms › 01. Searching and Sorting › 8. Integer and Distribution Sorting ›

Sparse Key Counting Sort

Counting sort variant that stores counts only for keys that appear, avoiding dense arrays over large key ranges.
algorithms sorting counting-sort sparse-keys
Wiki › Algorithms › 01. Searching and Sorting › 8. Integer and Distribution Sorting ›

Floating Point Radix Sort

Radix sort for floating-point numbers by transforming their bit representation to preserve numeric order.
algorithms sorting radix-sort floating-point
Wiki › Algorithms › 01. Searching and Sorting › 8. Integer and Distribution Sorting ›

Signed Integer Radix Sort

Radix sort for signed integers by transforming values to preserve ordering across negative and positive ranges.
algorithms sorting radix-sort integer-sorting