> 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.

I thought it was Timsort?

radixsort isn't a comparison-based sort algorithm, so you're comparing apples to chickens.