Counting Sort Visualization & Animation

## Counting Sort Counting Sort is a non-comparison sorting algorithm. It counts the occurrences of each unique element and uses arithmetic to determine positions. ### How it works: 1. Find the range of input elements 2. Count occurrences of each element 3. Calculate cumulative counts 4. Place elements at their correct positions ### Characteristics: - Very fast for small range integers - Stable sort - Requires extra space proportional to range - Not suitable for large range or floating-point numbers