4 ms·
> heapsort (84x slower) […] I can't find an obvious contender for the sorting. Use the built-in sort instead of hand-rolling your own? The built-in sort is not
by masklinn 9y ago
> heapsort (84x slower) […] I can't find an obvious contender for the sorting.
Use the built-in sort instead of hand-rolling your own? The built-in sort is not a heapsort and though I don't know what it was before the 2.3 "timsort" implementation, the essay mentions Python 2.7 so I would assume it's not talking about the old built-in sort either.
- hellofunk 9y agoThis article predates Python 2.7 by 10 years. The link to 2.7 was probably added or edited many years later.