Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:01725282n
Noun Concept
Categories: Comparison sorts, Sorting algorithms, Stable sorts
EN
Timsort  Tim sort
EN
Timsort is a hybrid, stable sorting algorithm, derived from merge sort and insertion sort, designed to perform well on many kinds of real-world data. Wikipedia
Definitions
Relations
Sources
EN
Timsort is a hybrid, stable sorting algorithm, derived from merge sort and insertion sort, designed to perform well on many kinds of real-world data. Wikipedia
Sorting algorithm Wikidata
A sorting algorithm derived from mergesort and insertion sort, designed to perform well on many kinds of real-world data. Wiktionary
IS A
sorting algorithm
comparison sort
stable sorting algorithm
hybrid algorithm
BASED ON
insertion sort
merge sort
DISCOVERER OR INVENTOR
Tim Peters
NAMED AFTER
Tim Peters
USED BY
V8
Python
Java Platform, Standard Edition
USES
array
Wikipedia
EN
Timsort
Wikidata
EN
Timsort
Wiktionary
EN
Timsort
Wikipedia Redirections
EN
Tim sort

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License