4 ms·
Our benchmarks consistently show Tim sort as the fastest -stable- sort, But intro sort consistently beats it.
by TwoBit 13y ago
Our benchmarks consistently show Tim sort as the fastest -stable- sort, But intro sort consistently beats it.
- beagle3 13y agoWhich benchmarks would that be? TimSort as implemented in Python goes through the Python machinery of object comparison and object management in general. Make sure you do an apples<->apples comparison when benchmarking.
- stuhood 13y agoTimsort is in JDK7, btw. http://grepcode.com/file/repository.grepcode.com/java/root/jdk/openjdk/7-b147/java/util/TimSort.java http://grepcode.com/file/repository.grepcode.com/java/root/j...