Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Adaptive_heap_sort> ?p ?o. }
Showing items 1 to 35 of
35
with 100 items per page.
- Adaptive_heap_sort abstract "The adaptive heap sort is a sorting algorithm that is similar to heap sort, but uses a randomized binary search tree to structure the input according to any preexisting order. The randomized binary search tree is used to select candidates that are put into the heap, so the heap doesn't need to keep track of all elements. Adaptive heap sort is a part of the adaptive sorting family.The first adaptive heapsort was Dijkstra's Smoothsort.".
- Adaptive_heap_sort wikiPageID "4261544".
- Adaptive_heap_sort wikiPageRevisionID "544308678".
- Adaptive_heap_sort hasPhotoCollection Adaptive_heap_sort.
- Adaptive_heap_sort subject Category:Comparison_sorts.
- Adaptive_heap_sort subject Category:Heaps_(data_structures).
- Adaptive_heap_sort subject Category:Sorting_algorithms.
- Adaptive_heap_sort type Abstraction100002137.
- Adaptive_heap_sort type Act100030358.
- Adaptive_heap_sort type Activity100407535.
- Adaptive_heap_sort type Algorithm105847438.
- Adaptive_heap_sort type Category105838765.
- Adaptive_heap_sort type Cognition100023271.
- Adaptive_heap_sort type ComparisonSorts.
- Adaptive_heap_sort type Concept105835747.
- Adaptive_heap_sort type Content105809192.
- Adaptive_heap_sort type Event100029378.
- Adaptive_heap_sort type Idea105833840.
- Adaptive_heap_sort type Kind105839024.
- Adaptive_heap_sort type Procedure101023820.
- Adaptive_heap_sort type PsychologicalFeature100023100.
- Adaptive_heap_sort type Rule105846932.
- Adaptive_heap_sort type SortingAlgorithm105847658.
- Adaptive_heap_sort type SortingAlgorithms.
- Adaptive_heap_sort type YagoPermanentlyLocatedEntity.
- Adaptive_heap_sort comment "The adaptive heap sort is a sorting algorithm that is similar to heap sort, but uses a randomized binary search tree to structure the input according to any preexisting order. The randomized binary search tree is used to select candidates that are put into the heap, so the heap doesn't need to keep track of all elements. Adaptive heap sort is a part of the adaptive sorting family.The first adaptive heapsort was Dijkstra's Smoothsort.".
- Adaptive_heap_sort label "Adaptive heap sort".
- Adaptive_heap_sort label "Heap sort adaptativo".
- Adaptive_heap_sort sameAs Heap_sort_adaptativo.
- Adaptive_heap_sort sameAs m.0bsy88.
- Adaptive_heap_sort sameAs Q4680746.
- Adaptive_heap_sort sameAs Q4680746.
- Adaptive_heap_sort sameAs Adaptive_heap_sort.
- Adaptive_heap_sort wasDerivedFrom Adaptive_heap_sort?oldid=544308678.
- Adaptive_heap_sort isPrimaryTopicOf Adaptive_heap_sort.