This HTML5 document contains 30 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

Prefix	IRI
dct	http://purl.org/dc/terms/
yago-res	http://yago-knowledge.org/resource/
dbo	http://dbpedia.org/ontology/
foaf	http://xmlns.com/foaf/0.1/
dbt	http://dbpedia.org/resource/Template:
rdfs	http://www.w3.org/2000/01/rdf-schema#
freebase	http://rdf.freebase.com/ns/
rdf	http://www.w3.org/1999/02/22-rdf-syntax-ns#
owl	http://www.w3.org/2002/07/owl#
n7	http://en.wikipedia.org/wiki/
dbc	http://dbpedia.org/resource/Category:
prov	http://www.w3.org/ns/prov#
dbp	http://dbpedia.org/property/
xsdh	http://www.w3.org/2001/XMLSchema#
gold	http://purl.org/linguistics/gold/
dbr	http://dbpedia.org/resource/

Statements

Subject Item

dbr:Adaptive_heap_sort

rdf:type

dbo:Software

rdfs:label

Adaptive heap sort

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.

owl:sameAs

freebase:m.0bsy88 yago-res:Adaptive_heap_sort

dbp:wikiPageUsesTemplate

dbt:Reflist

dct:subject

dbc:Sorting_algorithms dbc:Comparison_sorts dbc:Heaps_(data_structures)

gold:hypernym

dbr:Algorithm

prov:wasDerivedFrom

n7:Adaptive_heap_sort?oldid=1020138397&ns=0

dbo:wikiPageID

4261544

dbo:wikiPageLength

8741

dbo:wikiPageRevisionID

1020138397

dbo:wikiPageWikiLink

dbr:Measure_of_presortedness dbc:Heaps_(data_structures) dbr:Adaptive_sort dbr:Big_O_notation dbr:Binary_heap dbr:Heapsort dbc:Comparison_sorts dbr:Binary_tree dbr:Sorting_algorithm dbc:Sorting_algorithms dbr:Christos_Levcopoulos dbr:Cartesian_tree dbr:Comparison_sort dbr:Ola_Petersson

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.

foaf:isPrimaryTopicOf

n7:Adaptive_heap_sort