Please enable JavaScript.
Coggle requires JavaScript to display documents.
Efficient sorting algorithms (Benchmark (Impact of arrays' entropy in…
Efficient sorting algorithms
Usages
data organization
algorithms optimizations
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
Optimization of algorithms' parts (named atom)
properties
inplace
stable
k-aware
Name of actual methods
Big arrays
PowerSort
ShiverSort
Our paper's method :
AdaptativeShiverSort
TimSort
IntroSort
Small arrays
InsertionSort
BinaryInsertionSort
Name of old methods
QuickSort
MergeSort