Tim Sort

preview_player
Показать описание
Visualization and "audibilization" of the TimSort algorithm.
After the slow sorting of [1,100], the algorithm is run again faster on [1,1260].
Рекомендации по теме
Комментарии
Автор

And here I thought the person who uploaded this video came up with a new sorting algorithm and sorta named it after himself

ayior
Автор

A bastard born between merge sort and insertion sort

jeongheonlee
Автор

1:49 when someone repeats something slowly to me expecting me to understand what they're talking about

domjanabi
Автор

Thank you for the visualization.  I have one important request though.  Can you publish another video but with a dataset that shows-off the winning feature of Timsort which is taking advantage of partial orderings in the dataset.   In other words, Timsort mainly shines with real data and isn't anything special when confronted with pure random numbers.

raymondhettinger
Автор

A very good stable hybrid sort for modern machines with plenty of memory. Performs well on all input data [best case O(n), worst case O(n log n)] but uses O(n) extra space.

dlwatib
Автор

Hands down the best video game I’ve ever played.

FranklyNorman
Автор

This is almost just like the merge sort.

KidbooStudiosGaming
Автор

There’s no one in your contacts matching ’Tim Sort’.

Amechaniaa
Автор

so correct me if i'm wrong. Tim sort is technically merge sort with the base case of the minimum size of a run. a run will then be sorted using a different sorting algorithm?

JackLe
Автор

I still don't know what "galloping mode" is, though.

dannyundos
Автор

Did I accidentally turn on Everything Is Going To Be Ok

ona
Автор

This is basically weave sort/merge + insertion sort

karamboubou
Автор

Ive been watching these sorts and i was wondering how you end up with two copies of some elements in the list?
Like at 0:50 there are several of the lower elements being duplicated onto the left side before being removed from the center/right

skandragon
Автор

Tim sort: Insertion sort, merge…sometimes backwards

want-diversecontent
Автор

Insertion sort to a certain length, followed by merge sort.

RonWolfHowl
Автор

it's an insertion sort combined with a merge sort

jercki
Автор

.sorted() python function behind the scenes!

sutterismine
Автор

AAnd finally, i understood how TimeSort works!!!!

unknown_Rishi
Автор

looks like a merge but sorting is little different

-wv
Автор

0:28 How the bars disappear and re-appear?

mfmkktp