> radixsort is much faster and performs in O(n). Radix sort time complexity is not O(n); it's O(n*k) where k is the size of the largest element. Besides it has

> radixsort is much faster and performs in O(n). Radix sort time complexity is not O(n); it's O(n*k) where k is the size of the largest element. Besides it has an additional O(n+k) space complexity.