Adaptive heap sort (original) (raw)
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.
| Property | Value |
|---|---|
| dbo:abstract | 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. (en) O heap sort adaptativo é um algoritmo de ordenação que é semelhante ao heap sort, mas usa um para a estrutura da entrada de acordo com uma ordem preexistente. A árvore de busca binária aleatória é usada para selecionar os candidatos que são colocados no heap, de modo que o heap não precisa se manter a par de todos os elementos. O heap sort adaptativo é parte da família de algoritmos de ordenação adaptativos. Publicado por Christos Levcopoulos e Ola Petersson em 1992, o algoritmo utiliza uma nova medida de pré-seleção, Osc, como o número de oscilações. (pt) |
| dbo:wikiPageID | 4261544 (xsd:integer) |
| dbo:wikiPageLength | 8693 (xsd:nonNegativeInteger) |
| dbo:wikiPageRevisionID | 1116563846 (xsd:integer) |
| dbo:wikiPageWikiLink | dbr:Binary_heap dbr:Binary_tree dbr:Comparison_sort dbr:Adaptive_sort dbc:Comparison_sorts dbc:Sorting_algorithms dbc:Heaps_(data_structures) dbr:Heapsort dbr:Big_O_notation dbr:Sorting_algorithm dbr:Cartesian_tree dbr:Christos_Levcopoulos dbr:Measure_of_presortedness dbr:Ola_Petersson |
| dbp:wikiPageUsesTemplate | dbt:Reflist |
| dct:subject | dbc:Comparison_sorts dbc:Sorting_algorithms dbc:Heaps_(data_structures) |
| gold:hypernym | dbr:Algorithm |
| rdf:type | dbo:Software yago:WikicatComparisonSorts yago:WikicatSortingAlgorithms yago:Abstraction100002137 yago:Act100030358 yago:Activity100407535 yago:Algorithm105847438 yago:Category105838765 yago:Cognition100023271 yago:Concept105835747 yago:Content105809192 yago:Event100029378 yago:Idea105833840 yago:Kind105839024 yago:Procedure101023820 yago:PsychologicalFeature100023100 yago:YagoPermanentlyLocatedEntity yago:Rule105846932 yago:SortingAlgorithm105847658 |
| rdfs:comment | 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. (en) O heap sort adaptativo é um algoritmo de ordenação que é semelhante ao heap sort, mas usa um para a estrutura da entrada de acordo com uma ordem preexistente. A árvore de busca binária aleatória é usada para selecionar os candidatos que são colocados no heap, de modo que o heap não precisa se manter a par de todos os elementos. O heap sort adaptativo é parte da família de algoritmos de ordenação adaptativos. Publicado por Christos Levcopoulos e Ola Petersson em 1992, o algoritmo utiliza uma nova medida de pré-seleção, Osc, como o número de oscilações. (pt) |
| rdfs:label | Adaptive heap sort (en) Heap sort adaptativo (pt) |
| owl:sameAs | freebase:Adaptive heap sort yago-res:Adaptive heap sort wikidata:Adaptive heap sort dbpedia-pt:Adaptive heap sort dbpedia-sr:Adaptive heap sort http://ta.dbpedia.org/resource/தகவமைப்பு_குவியல்_வகை_வரிசையாக்கம் https://global.dbpedia.org/id/4LUJW |
| prov:wasDerivedFrom | wikipedia-en:Adaptive_heap_sort?oldid=1116563846&ns=0 |
| foaf:isPrimaryTopicOf | wikipedia-en:Adaptive_heap_sort |
| is dbo:wikiPageRedirects of | dbr:Adaptive_heapsort |
| is dbo:wikiPageWikiLink of | dbr:Comparison_sort dbr:Adaptive_sort dbr:List_of_terms_relating_to_algorithms_and_data_structures dbr:Adaptive_heapsort |
| is foaf:primaryTopic of | wikipedia-en:Adaptive_heap_sort |