It has been proven that comparison-based sorting algorithms have a lower bound of \(O(n\log n)\) , where \(n\)  is size of the input [1]}. However, lower bound does not apply to integer sorting, which is a special case of sorting [2]}. Integer sorts can be faster than comparison based sorting algorithms because they make assumptions about the input array. Both the RADIX sort and the bucket sort are integer sorting algorithms.
