Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Introselect> ?p ?o. }
Showing items 1 to 15 of
15
with 100 items per page.
- Introselect abstract "In computer science, introselect (short for "introspective selection") is a selection algorithm that is a hybrid of quickselect and median of medians which has fast average performance and optimal worst-case performance. Introselect is related to the introsort sorting algorithm: these are analogous refinements of the basic quickselect and quicksort algorithms, in that they both start with the quick algorithm, which has good average performance and low overhead, but fall back to an optimal worst-case algorithm (with higher overhead) if the quick algorithm does not progress rapidly enough. Both algorithms were introduced by David Musser in (Musser 1997), with the purpose of providing generic algorithms for the C++ Standard Library which had both fast average performance and optimal worst-case performance, thus allowing the performance requirements to be tightened.".
- Introselect wikiPageID "11062320".
- Introselect wikiPageRevisionID "570101670".
- Introselect class "Selection algorithm".
- Introselect data Array_data_structure.
- Introselect name "Introselect".
- Introselect optimal "Yes".
- Introselect subject Category:Selection_algorithms.
- Introselect comment "In computer science, introselect (short for "introspective selection") is a selection algorithm that is a hybrid of quickselect and median of medians which has fast average performance and optimal worst-case performance.".
- Introselect label "Introselect".
- Introselect sameAs m.0wxs6y9.
- Introselect sameAs Q17092644.
- Introselect sameAs Q17092644.
- Introselect wasDerivedFrom Introselect?oldid=570101670.
- Introselect isPrimaryTopicOf Introselect.