Efficient sorting algorithms

Usages

Benchmark

Impact of arrays' entropy in the benchmark

Data-sets of real arrays

Running several tests in parallel

Tests reproducibility

Impact of hardware on benchmark results

properties

inplace

stable

data organization

algorithms optimizations

Name of actual methods

Big arrays

PowerSort

ShiverSort

Our paper's method :
AdaptativeShiverSort

TimSort

Name of old methods

QuickSort

Small arrays

MergeSort

InsertionSort

BinaryInsertionSort

Optimization of algorithms' parts (named atom)

IntroSort

k-aware