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)

Related topics

Related topics

24 relations
Adaptive sortAnalysis of algorithmsAndroidArray data structure

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
A Comparative Study of Sorting Algorithms with FPGA Acceleration by High Level Synthesis
Nowadays, sorting is an important operation for several real-time embedded applications. It is one of the most commonly studied… 
2018
2018
Strategies for Stable Merge Sorting
We introduce new stable, natural merge sort algorithms, called 2-merge sort and $\alpha$-merge sort. We prove upper and lower… 
2017
2017
Using the Integrated GPU to Improve CPU Sort Performance
In this paper we discuss the potential of the integrated GPU to accelerate sorting by performing a partial sort prior to a… 
2017
2017
Proving JDK's Dual Pivot Quicksort Correct
Sorting is a fundamental functionality in libraries, for which efficiency is crucial. Correctness of the highly optimised… 
2016
2016
Sort Race
Sorting is one of the oldest computing problems and is still very important in the age of big data. Various algorithms and… 
2015
2015
Merge Strategies: from Merge Sort to TimSort
The introduction of TimSort as the standard algorithm for sorting in Java and Python questions the generally accepted idea that… 
Highly Cited
2015
Highly Cited
2015
OpenJDK's Java.utils.Collection.sort() Is Broken: The Good, the Bad and the Worst Case
We investigate the correctness of TimSort, which is the main sorting algorithm provided by the Java standard library. The goal is… 
2015
2015
Diploma ThesisA Time-Based Adaptive Hybrid Sorting Algorithm on CPU and GPU with Application to Collision Detection Selbstständigkeitserklärung
Real world data is often being sorted in a repetitive way. In many applications, only small parts change within a small time… 
2015
2015
Fixing the Sorting Algorithm for Android, Java and Python
Tim Peters developed the Timsort hybrid sorting algorithm in 2002. TimSort was first developed for Python, a popular programming… 
2014
2014
Patience is a virtue: revisiting merge and sort on modern processors
The vast quantities of log-based data appearing in data centers has generated an interest in sorting almost-sorted datasets. We… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)