Skip to search formSkip to main contentSkip to account menu

Timsort

Known as: Tim sort 
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 (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
In this paper we discuss the potential of the integrated GPU to accelerate sorting by performing a partial sort prior to a… 
2016
2016
Sorting is one of the oldest computing problems and is still very important in the age of big data. Various algorithms and… 
2015
2015
Tim Peters developed the Timsort hybrid sorting algorithm in 2002. TimSort was first developed for Python, a popular programming… 
2015
2015
Afgelopen februari dienden onderzoekers van het Centrum Wiskunde & Informatica een bugreport in voor Java. Het standaard… 
2015
2015
Abstract. Some of the arguments often invoked against the usage of formal software verification include the following: it is… 
2015
2015
htmlabstractAfgelopen februari dienden onderzoekers van het Centrum Wiskunde & Informatica een bugreport in voor Java. Het… 
2015
2015
Real world data is often being sorted in a repetitive way. In many applications, only small parts change within a small time…