Published by Dimitris Kougioumtzis · Updated
Count values in holes spanning the minimum-to-maximum input range, then collect them.
Allocate a hole for every key in the bounded range and reconstruct values from occurrence counts.
When to use Pigeonhole sort
Small dense key ranges.
Choosing an alternative
Comparison sorting avoids storage for absent values in a wide domain.
Worked example: input and state changes
Example input
38, 12, 65, 8, 43, 27, 91, 19
These checkpoints follow the actual example timeline. State details show the stored values and decisions; use the visualization to inspect every intervening step.
Step 0: Initial state.
State at this checkpoint
{ "values": [ 38, 12, 65, 8, 43, 27, 91, 19 ], "active": [] }Step 4: Add 8 to hole 0.
State at this checkpoint
{ "values": [ 38, 12, 65, 8, 43, 27, 91, 19 ], "active": [ 3 ] }Step 9: Collect value 8.
State at this checkpoint
{ "values": [ 8, 12, 65, 8, 43, 27, 91, 19 ], "active": [ 0 ] }Step 13: Collect value 38.
State at this checkpoint
{ "values": [ 8, 12, 19, 27, 38, 27, 91, 19 ], "active": [ 4 ] }Step 17: Complete: values are in ascending order.
State at this checkpoint
{ "values": [ 8, 12, 19, 27, 38, 43, 65, 91 ], "active": [] }
Expected final state
Complete: values are in ascending order.
Complexity and input bounds
Family: Sorting. Time complexity: O(n + range).
Space complexity: O(range) holes or counters.
Working-space bounds describe algorithm state and any explicitly noted output, excluding the visualization's saved timeline. Recording frames can use more memory than running the function alone. Here n is sequence length, V and E are vertex and edge counts, and other parameters refer to the named input dimensions.
2–24 comma-separated integers between 0 and 99.
The playground validates these limits before starting. Downloaded functions are callable implementations, with parameter and output-buffer contracts in their comments; they do not all repeat the playground's input validation.
Common mistakes and limitations
Memory depends on key range rather than only input length.
Further reading
For background on algorithm analysis and the JavaScript function interface:
- MIT OpenCourseWare: algorithm design and analysis foundations
- MDN: JavaScript function parameters and return values
Editorial and testing approach · Browse all algorithm guides
Complete JavaScript implementation
1 2 3 4 5 6 7 8 9 10 11 | // Sorts a in place. n is the array length. Return value 0 indicates completion. Reference snippets assume validated playground inputs. Fixed scratch buffers have 256 slots. Sorting variants may use a different traversal strategy than the animation. function algorithm(a, n) { let minimum = a[0]; let maximum = a[0]; let holes = Array(256).fill(0); for (let i = 0; i < n; i++) { if (a[i] < minimum) { minimum = a[i]; } if (a[i] > maximum) { maximum = a[i]; } } for (let i = 0; i < n; i++) { holes[a[i] - minimum]++; } let k = 0; for (let i = 0; i <= maximum - minimum; i++) { while (holes[i] > 0) { a[k++] = minimum + i; holes[i]--; } } return 0; } |
Source
No original paper has been verified for this entry. This source is a reference text or teaching reference, not an asserted original publication.
- The Art of Computer Programming, Volume 3: Sorting and Searching (2nd edition)
Donald E. Knuth (1998). Reference book.