I know. I thought about it, but it would basically add + O(N) sorting time, so I opted not to for this example.

For small integer sorts, this is definitely practical and fast.

But sure, you could always make your own example to demonstrate the point or make a real bucket sort. I don't think if I'm for such a challenge at the moment...

Erm, I take it that means if I have N items, the values of those numbers are 0...N-1. If so, then it is very possible to sort in O(N) and my sorting example points that out very well.