Ages

You are given the ages of $n$ residents. Every age is an integer from $1$ to $100$. Print the ages in increasing order.

The first line contains $n$ ($1 \le n \le 2 \cdot 10^5$). The second line contains $n$ integers $a_i$ ($1 \le a_i \le 100$).

A single line with $n$ numbers — the sorted ages.

When the range of values is small, you can sort without comparisons — counting sort. Count in an array cnt of $100$ elements how many times each age occurs, then for $v = 1, 2, \ldots, 100$ print $v$ exactly cnt[v] times. This is $O(n + 100)$ — faster than $O(n \log n)$.

Source: UVa 11462.