Adaptive heap sort
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 and 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 take part of the data into the heap so that the run time will reduce significantly when the presortedness of the data is high.
- Abstraction100002137
- Act100030358
- Activity100407535
- Algorithm105847438
- Category105838765
- Cognition100023271
- Concept105835747
- Content105809192
- Event100029378
- Idea105833840
- Kind105839024
- Procedure101023820
- PsychologicalFeature100023100
- Rule105846932
- software
- SortingAlgorithm105847658
- WikicatComparisonSorts
- WikicatSortingAlgorithms
- YagoPermanentlyLocatedEntity
- Comment
- enIn 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 and 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 take part of the data into the heap so that the run time will reduce significantly when the presortedness of the data is high.
- Has abstract
- enIn 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 and 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 take part of the data into the heap so that the run time will reduce significantly when the presortedness of the data is high.
- Hypernym
- Algorithm
- Is primary topic of
- Adaptive heap sort
- Label
- enAdaptive heap sort
- Link from a Wikipage to another Wikipage
- Adaptive sort
- Big O notation
- Binary heap
- Binary tree
- Cartesian tree
- Category:Comparison sorts
- Category:Heaps (data structures)
- Category:Sorting algorithms
- Christos Levcopoulos
- Comparison sort
- Heapsort
- Measure of presortedness
- Ola Petersson
- Sorting algorithm
- SameAs
- 4LUJW
- Adaptive heap sort
- Heap sort adaptativo
- m.0bsy88
- Prilagodljivo hip sortiranje
- Q4680746
- தகவமைப்பு குவியல் வகை வரிசையாக்கம்
- Subject
- Category:Comparison sorts
- Category:Heaps (data structures)
- Category:Sorting algorithms
- WasDerivedFrom
- Adaptive heap sort?oldid=1116563846&ns=0
- WikiPageLength
- 8693
- Wikipage page ID
- 4261544
- Wikipage revision ID
- 1116563846
- WikiPageUsesTemplate
- Template:Reflist