Metraipolis › archive › dc_fdd9172cc847

Adaptive heap sort — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Adaptive_heap_sort
License (as archived)
CC-BY-SA-4.0
Archived
2026-11-07T13:27:56.991Z
SHA-256 of the archived text
9e5834202ea52e104947f8a0d09dcd46d48fc72ed7c6861a537cc0ce7d3ca612
Stable URL of this page
https://metraipolis.com/documento/dc_fdd9172cc847

How to cite

Adaptive heap sort — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Adaptive_heap_sort (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_fdd9172cc847 (Metraipolis archive dc_fdd9172cc847, sha256 9e5834202ea52e104947f8a0d09dcd46d48fc72ed7c6861a537cc0ce7d3ca612)
BibTeX
@misc{dcfdd9172cc847,
  title = {Adaptive heap sort — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Adaptive_heap_sort},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_fdd9172cc847; sha256 9e5834202ea52e104947f8a0d09dcd46d48fc72ed7c6861a537cc0ce7d3ca612},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Adaptive_heap_sort. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

In computer science, adaptive heap sort is a comparison-based sorting algorithm of the adaptive sort family. It is a variant of heap sort that performs better when the data contains existing order. Published by Christos Levcopoulos and Ola Petersson in 1992, the algorithm utilizes a new measure of presortedness, Osc, as the number of oscillations. Instead of putting all the data into the heap as the traditional heap sort did, adaptive heap sort only takes part of the data into the heap so that the run time will reduce significantly when the presortedness of the data is high.

Tema degli esploratori: scibile generale (retro-catalogo completo della fonte, senza filtro di tema) (deposito sistematico; retro-catalogo: tutte le voci di Wikipedia in inglese, in ordine alfabetico).
Fonte: Wikipedia in inglese, voce «Adaptive heap sort» — https://en.wikipedia.org/wiki/Adaptive_heap_sort
Wikidata Q4680746: «comparison-based sorting algorithm» (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q4680746
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Adaptive_heap_sort?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1318332272, consultata il 2026-11-07T13:23:46.997Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: f3d2ade5b000a234b3075df610dfebacfc4689d8f6e4a33a29b5d8ccdd4e1964