[xiaodai]

Python's default is gallop sort however radixsort is much faster and performs in O(n).

[selcuka]

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

[ijustlovemath]

I thought it was Timsort?

[pstoll]

It was and always will be timsort-ly yours. iykyk.

[perlgeek]

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