Powersort

Sorting algorithm

Texto em inglês

Na Wikipédia

Texto em inglês Ainda não há artigo no seu idioma: trecho em inglês.

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.

Texto: Wikipédia em inglês, CC BY-SA 4.0. ·

Cartas próximas

Tree sort

Sorting algorithm that builds a binary search tree and then traverses the tree

Nº Q863521 ★

Sem ofertas
T

Timsort

Nº Q942403 ★★★

Sem ofertas
Quicksort

Algoritmo de ordenação

Nº Q486598 ★★★★

Sem ofertas
Selection sort

Nº Q220831 ★★

Sem ofertas
M

Método das potências

Nº Q1426504 ★

Sem ofertas
Quickselect

Selection algorithm to find the kth smallest element in an unordered list

Nº Q3927837 ★

Sem ofertas

Carregar mais