Our benchmarks consistently show Tim sort as the fastest -stable- sort, But intr... | Hacker News

Hacker Newsnew | past | comments | ask | show | jobs | submit

TwoBit on March 15, 2014 | parent | context | favorite | on: WikiSort – Fast, stable, O(1) space merge sort alg...

Our benchmarks consistently show Tim sort as the fastest -stable- sort, But intro sort consistently beats it.

beagle3 on March 15, 2014 [–]

Which 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 on March 16, 2014 | [–]

Timsort is in JDK7, btw.

http://grepcode.com/file/repository.grepcode.com/java/root/j...

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact