Question

I've coded mergesort() in python... but it's slow and has takes 20 seconds to sort an array of a million 32-bit integers in reversed order back to ascending order.

How do I optimize my sorting code?

Answer 1

for comparison... the native (tim)sort algorithm takes 0.04 seconds to sort a million 32-bit integers worst case