DBpedia 2016-04

Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q117241> ?p ?o }

Showing triples 1 to 57 of 57 with 100 triples per page.

Q117241 subject Q7015108.
Q117241 subject Q7015109.
Q117241 subject Q7015110.
Q117241 subject Q8269001.
Q117241 subject Q8772745.
Q117241 abstract "Insertion sort is a simple sorting algorithm that builds the final sorted array (or list) one item at a time. It is much less efficient on large lists than more advanced algorithms such as quicksort, heapsort, or merge sort. However, insertion sort provides several advantages: Simple implementation: Bentley shows a three-line C version, and a five-line optimized version Efficient for (quite) small data sets, much like other quadratic sorting algorithms More efficient in practice than most other simple quadratic (i.e., O(n2)) algorithms such as selection sort or bubble sort Adaptive, i.e., efficient for data sets that are already substantially sorted: the time complexity is O(nk) when each element in the input is no more than k places away from its sorted position Stable; i.e., does not change the relative order of elements with equal keys In-place; i.e., only requires a constant amount O(1) of additional memory space Online; i.e., can sort a list as it receives itWhen people manually sort cards in a bridge hand, most use a method that is similar to insertion sort.".
Q117241 thumbnail Insertionsort-edited.png?width=300.
Q117241 wikiPageExternalLink ?InsertionSort.
Q117241 wikiPageExternalLink insertion.htm.
Q117241 wikiPageExternalLink program-to-sort-the-numbers-using-insertion-sort.
Q117241 wikiPageExternalLink Category:Insertion_sort.
Q117241 wikiPageExternalLink Insertion_sort.
Q117241 wikiPageExternalLink sorting-demo.html.
Q117241 wikiPageExternalLink binary.html.
Q117241 wikiPageExternalLink insertion-sort.
Q117241 wikiPageWikiLink Q145.
Q117241 wikiPageWikiLink Q15777.
Q117241 wikiPageWikiLink Q16.
Q117241 wikiPageWikiLink Q174077.
Q117241 wikiPageWikiLink Q175263.
Q117241 wikiPageWikiLink Q181593.
Q117241 wikiPageWikiLink Q186152.
Q117241 wikiPageWikiLink Q189057.
Q117241 wikiPageWikiLink Q189224.
Q117241 wikiPageWikiLink Q2005893.
Q117241 wikiPageWikiLink Q205908.
Q117241 wikiPageWikiLink Q220831.
Q117241 wikiPageWikiLink Q2393193.
Q117241 wikiPageWikiLink Q243754.
Q117241 wikiPageWikiLink Q269878.
Q117241 wikiPageWikiLink Q274089.
Q117241 wikiPageWikiLink Q3495147.
Q117241 wikiPageWikiLink Q3611577.
Q117241 wikiPageWikiLink Q380172.
Q117241 wikiPageWikiLink Q4355278.
Q117241 wikiPageWikiLink Q474095.
Q117241 wikiPageWikiLink Q486598.
Q117241 wikiPageWikiLink Q60864.
Q117241 wikiPageWikiLink Q651022.
Q117241 wikiPageWikiLink Q657037.
Q117241 wikiPageWikiLink Q671298.
Q117241 wikiPageWikiLink Q7003418.
Q117241 wikiPageWikiLink Q7015108.
Q117241 wikiPageWikiLink Q7015109.
Q117241 wikiPageWikiLink Q7015110.
Q117241 wikiPageWikiLink Q7563772.
Q117241 wikiPageWikiLink Q786431.
Q117241 wikiPageWikiLink Q82438.
Q117241 wikiPageWikiLink Q8269001.
Q117241 wikiPageWikiLink Q848955.
Q117241 wikiPageWikiLink Q863521.
Q117241 wikiPageWikiLink Q8772745.
Q117241 wikiPageWikiLink Q9012529.
Q117241 wikiPageWikiLink Q93133.
Q117241 comment "Insertion sort is a simple sorting algorithm that builds the final sorted array (or list) one item at a time. It is much less efficient on large lists than more advanced algorithms such as quicksort, heapsort, or merge sort.".
Q117241 label "Insertion sort".
Q117241 depiction Insertionsort-edited.png.