Benchmark result for numpy sorting algorithms. Includes Quicksort, Mergesort, Heapsort and Timsort. Focused on nearly sorted data.
For detailed numbers, see the *.txt Files.
- For shapes of the arrays involved in this benchmark, see the jupyter-notebook.
- Timsort shows minimal overhead on random array while performs well at nearly sorted array.
- For swapped pair arrays timsort seems not fast enough, however this is because quicksort is so good at this kind of array.