Powersort
Sorting algorithm
Powersort is an adaptive sorting algorithm designed to optimally exploit existing order in the input data with minimal overhead. Powersort is the default list-sorting algorithm in CPython since version 3.11 and is also used in NumPy, PyPy, AssemblyScript, and Apple's WebKit.
Nº Q136399159 ★
Common · Knowledge
Powersort
Sorting algorithm
Powersort is an adaptive sorting algorithm designed to optimally exploit existing order in the input data with minimal overhead. Powersort is the default list-sorting algorithm in CPython since version 3.11 and is also used in NumPy, PyPy, AssemblyScript, and Apple's WebKit.
From Wikipedia
Powersort is an adaptive sorting algorithm designed to optimally exploit existing order in the input data with minimal overhead. Powersort is the default list-sorting algorithm in CPython since version 3.11 and is also used in NumPy, PyPy, AssemblyScript, and Apple's WebKit. Powersort belongs to the family of merge sort algorithms. More specifically, Powersort builds on Timsort; it is a drop-in replacement for Timsort's suboptimal heuristic merge policy. Unlike Timsort, Powersort is derived from first principles (see connection to nearly optimal binary search trees) and offers strong performance guarantees. Like Timsort, Powersort is stable and comparison-based. This property is essential for many applications. Powersort was proposed by J. Ian Munro and Sebastian Wild.
Text: Wikipédia, CC BY-SA 4.0. ·
Related cards
-
Tree sort
Sorting algorithm that builds a binary search tree and then traverses the tree
Nº Q863521 ★
Not listed
-
T
Timsort
Hybrid sorting algorithm based on insertion sort and merge sort
Nº Q942403 ★★★
Not listed
-
Quicksort
Divide and conquer sorting algorithm
Nº Q486598 ★★★★
Not listed
-
Selection sort
Sorting algorithm
Nº Q220831 ★★
Not listed
-
P
Power iteration
Eigenvalue algorithm
Nº Q1426504 ★
Not listed
-
Quickselect
Selection algorithm to find the kth smallest element in an unordered list
Nº Q3927837 ★
Not listed