10 ms·

Oh, now I have to yell at myself. No doubt Python's sorted is some n*logn quicksort, and not actually in quadratic time. Crow for all!

• masklinn 14y ago
  It's an adaptive mergesort-based sort: http://en.wikipedia.org/wiki/Timsort http://en.wikipedia.org/wiki/Timsort
• gnuvince 14y ago
  Still, I'd rather have a loop and be linear than using a sort and being linearithmic.