new sorting algorithm
Mats Wichmann
mats at wichmann.us
Mon May 2 15:18:36 EDT 2022
On 5/2/22 07:09, charles hottel wrote:
> Some versions of Quicksort switch over to Straight Insertion Sort when
> the partitions become small enough. The correct size will vary depending
> on the hardware.
>
> I have not kept up with the latest improvements and I am not familiar
> with TimSort. However Heapsort should always be O(n log n) and there
> are modifications to Heapsort that can make it faster than vanilla
> Heapsort and closer to the speed of Quicksort.
A quick read might be in order then...
https://en.wikipedia.org/wiki/Timsort
More information about the Python-list
mailing list