4 ms·
Too bad it's missing Timsort, which is the fastest stable sort and the standard for some standard libraries.
by TwoBit 12y ago
Too bad it's missing Timsort, which is the fastest stable sort and the standard for some standard libraries.
- cvbncvbncgbc 12y agoCalling it fastest is not fair. Timsort appears to be very fast because most real world data we operate it on is somewhat sorted, but requires O(n) extra memory. It simply depends on the situation and data.