A comparison of all deterministic sorting algorithms on a standard data set.
The data set consists of 3 dynamically generated Python3 lists:
- near.txt : Nearly sorted array
- random.txt : Random integer array
- reverse.txt : Nearly sorted array in reverse order
- As the functions are written in Python3, they will, in general, perform worse than the built-in Timsort (sorted).
- Using proper optimisations and a lower-level language (C++11), Quicksort can hit 0.002s on randomly ordered lists.
- Intel Core i5 5520U @ 2.6GHz x64 with 8GB memory
- Python 3.6 + Cython CC
- common.wikimedia.org
- rosettacode.org