What is the fastest way to sort 1 million integers when integers are from the range [1,100]?

Question

Notes: I\'ve thought about Radix sort, bucket sort, counting sort.

Is there anyway to achieve big O(n)?

Answer 1

how about just counting the occurrence of each integer and then printing them all. sounds like O(n)