Non-Comparison sorting algorithms often need many assumptions about the
input data (integers from small range for count sort, uniformly distributed
for bucket sort, etc.).
The time complexity is also often dependent on only on the input size.
For instance count sort depends on the range, as well as the radix