3 ms·
Python's default is gallop sort however radixsort is much faster and performs in O(n).
by xiaodai 2y ago
Python's default is gallop sort however radixsort is much faster and performs in O(n).
- ijustlovemath 2y agoI thought it was Timsort?
- pstoll 2y agoIt was and always will be timsort-ly yours. iykyk.
- selcuka 2y ago> 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.
- perlgeek 2y agoradixsort isn't a comparison-based sort algorithm, so you're comparing apples to chickens.