ScratchData LogoScratchData
Back to _youtubeN1's profile

Prototype: Timsort

_Y_youtubeN1•Created November 28, 2015
Prototype: Timsort
15
7
268 views
View on Scratch

Instructions

Set sliders and press space. This sorting algorithm is similar to bottom-up mergesort, but instead of taking fixed sized sublists, it takes sublists either already sorted or reverse sorted, and reverses the ones which are reverse sorted. It starts merging sublists together like bottom-up mergesort until the list is sorted. The advantage is when big parts of the list is sorted, which uses less runs through the list to sort it, and it does fastest on reverse sorted an fully sorted lists.

Description

Thanks to Tim Peters for Timsort.

Project Details

Project ID89420221
CreatedNovember 28, 2015
Last ModifiedNovember 30, 2015
SharedNovember 29, 2015
Visibilityvisible
CommentsAllowed