Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Introsort> ?p ?o }
Showing triples 1 to 77 of
77
with 100 triples per page.
- Introsort abstract "Introsort or introspective sort is a hybrid sorting algorithm that provides both fast average performance and (asymptotically) optimal worst-case performance. It begins with quicksort and switches to heapsort when the recursion depth exceeds a level based on (the logarithm of) the number of elements being sorted. This combines the good parts of both algorithms, with practical performance comparable to quicksort on typical data sets and worst-case O(n log n) runtime due to the heap sort. Since both algorithms it uses are comparison sorts, it too is a comparison sort.Introsort was invented by David Musser in Musser (1997), in which he also introduced introselect, a hybrid selection algorithm based on quickselect (a variant of quicksort), which falls back to median of medians and thus provides worst-case linear complexity, which is optimal. Both algorithms were introduced 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.".
- Introsort wikiPageExternalLink stl_algo.h.
- Introsort wikiPageID "363477".
- Introsort wikiPageLength "5823".
- Introsort wikiPageOutDegree "37".
- Introsort wikiPageRevisionID "693397952".
- Introsort wikiPageWikiLink .NET_Framework.
- Introsort wikiPageWikiLink Array_data_structure.
- Introsort wikiPageWikiLink Array_slicing.
- Introsort wikiPageWikiLink Big_O_notation.
- Introsort wikiPageWikiLink C++_Standard_Library.
- Introsort wikiPageWikiLink CPU_cache.
- Introsort wikiPageWikiLink Category:Comparison_sorts.
- Introsort wikiPageWikiLink Comparison_sort.
- Introsort wikiPageWikiLink David_Musser.
- Introsort wikiPageWikiLink Denial-of-service_attack.
- Introsort wikiPageWikiLink Double-ended_queue.
- Introsort wikiPageWikiLink GNU_Compiler_Collection.
- Introsort wikiPageWikiLink Generic_programming.
- Introsort wikiPageWikiLink Heapsort.
- Introsort wikiPageWikiLink Hybrid_algorithm.
- Introsort wikiPageWikiLink Insertion_sort.
- Introsort wikiPageWikiLink Introselect.
- Introsort wikiPageWikiLink Logarithm.
- Introsort wikiPageWikiLink Median_of_medians.
- Introsort wikiPageWikiLink Microsoft.
- Introsort wikiPageWikiLink Niklaus_Wirth.
- Introsort wikiPageWikiLink Quickselect.
- Introsort wikiPageWikiLink Quicksort.
- Introsort wikiPageWikiLink Robert_Sedgewick_(computer_scientist).
- Introsort wikiPageWikiLink Selection_algorithm.
- Introsort wikiPageWikiLink Silicon_Graphics.
- Introsort wikiPageWikiLink Sort_(C++).
- Introsort wikiPageWikiLink Sorting_algorithm.
- Introsort wikiPageWikiLink Standard_Libraries_(CLI).
- Introsort wikiPageWikiLink Standard_Template_Library.
- Introsort wikiPageWikiLink Standard_library.
- Introsort wikiPageWikiLinkText "Introsort".
- Introsort wikiPageWikiLinkText "introsort".
- Introsort wikiPageWikiLinkText "introspective sort".
- Introsort averageTime "O".
- Introsort class Sorting_algorithm.
- Introsort data Array_data_structure.
- Introsort optimal "yes".
- Introsort time "O".
- Introsort wikiPageUsesTemplate Template:Cite_journal.
- Introsort wikiPageUsesTemplate Template:Harvtxt.
- Introsort wikiPageUsesTemplate Template:Infobox_Algorithm.
- Introsort wikiPageUsesTemplate Template:Math.
- Introsort wikiPageUsesTemplate Template:Mvar.
- Introsort wikiPageUsesTemplate Template:Refbegin.
- Introsort wikiPageUsesTemplate Template:Refend.
- Introsort wikiPageUsesTemplate Template:Reflist.
- Introsort wikiPageUsesTemplate Template:Sorting.
- Introsort subject Category:Comparison_sorts.
- Introsort hypernym Algorithm.
- Introsort type Software.
- Introsort type Algorithm.
- Introsort comment "Introsort or introspective sort is a hybrid sorting algorithm that provides both fast average performance and (asymptotically) optimal worst-case performance. It begins with quicksort and switches to heapsort when the recursion depth exceeds a level based on (the logarithm of) the number of elements being sorted. This combines the good parts of both algorithms, with practical performance comparable to quicksort on typical data sets and worst-case O(n log n) runtime due to the heap sort.".
- Introsort label "Introsort".
- Introsort sameAs Q1395653.
- Introsort sameAs Introsort.
- Introsort sameAs Introsort.
- Introsort sameAs مرتبسازی_درونگرا.
- Introsort sameAs Introsort.
- Introsort sameAs Innhorfsröðun.
- Introsort sameAs イントロソート.
- Introsort sameAs Sortowanie_introspektywne.
- Introsort sameAs Intro_sort.
- Introsort sameAs m.01_q1s.
- Introsort sameAs Introsort.
- Introsort sameAs Introsort.
- Introsort sameAs İçgözlemle_sıralama.
- Introsort sameAs Q1395653.
- Introsort sameAs 内省排序.
- Introsort wasDerivedFrom Introsort?oldid=693397952.
- Introsort isPrimaryTopicOf Introsort.