Timsort
id:
timsort-176-18824838
title:
Timsort
text:
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. It was implemented by Tim Peters in 2002 for use in the Python programming language. The algorithm finds subsequences of the data that are already ordered (runs) and uses them to sort the remainder more efficiently. This is done by merging runs until certain criteria are fulfilled. Timsort was Python's standard sorting algorithm from version 2.3 to
brand slug:
wiki
category slug:
encyclopedia
description:
Hybrid sorting algorithm based on insertion sort and merge sort
original url:
https://en.wikipedia.org/wiki/Timsort
date created:
2009-08-12T06:40:48Z
date modified:
2024-09-04T08:00:35Z
main entity:
{"identifier":"Q942403","url":"https://www.wikidata.org/entity/Q942403"}
image:
fields total:
13
integrity:
15