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

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

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

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

R has that too.

really? thought it just function(x)

Totally RAD!

the julia solution was bad

Cos shipping things is not a concern

They should hire English teachers to fix their grammar. “Will hire no more engineers.” Wtf

It's fine to say "X will hire no additional staff" or "X will remain asleep no longer". These are established phrasings in English.

Scammy. I can’t even preview one

Hi, look under the History page if you already submitted a drawing with the free token.

India did invent the game (probably).

get outta here!

Bro you're still trolling people lol