Naming Sorting Problems

Print the names in order from $1$ to $N$. Time complexity is $O(N)$. The largest number is $100$.