Problem Statement
Sort array using counting sort.
Approach
Count occurrences of each element, compute cumulative counts, place elements.
Time & Space Complexity
Time O(n+k), Space O(k) where k is range.

The DSA Visualizer is designed for deep focus,
side-by-side code, and real-time execution insight.
On small screens, that level of clarity can't be preserved.
Open on a tablet (landscape) or desktop for the intended experience.
Desktop experience preview
Non-comparison sorting for integers with limited range.
Sort array using counting sort.
Count occurrences of each element, compute cumulative counts, place elements.
Time O(n+k), Space O(k) where k is range.
Loading Interactive Visualizer...
Click "Play" or use arrow keys to step through the execution.