Computer scienceProgramming languagesPythonAdditional instrumentsAlgorithms and data structures

sort() under the hood

Theory

The algorithm steps

Report a typo

We want to use Timsort on a list that includes 100 elements. Below, you have the steps of the algorithm. Your task is to put them in the correct order.

Put the items in the correct order
See if there are more or less than 64 elements in the list
Make sure every run is at least the size of minrun, if not, use Insertion sort to add elements
Merge all the runs two at a time
Go through the list collecting natural runs
___

Create a free account to access the full topic