| dbo:abstract |
Merge Insertion (auch bekannt als Ford-Johnson-Algorithmus) ist ein rekursives, vergleichsorientiertes Sortierverfahren, das mit weniger Vergleichen als Mergesort auskommt. (de) In computer science, merge-insertion sort or the Ford–Johnson algorithm is a comparison sorting algorithm published in 1959 by L. R. Ford Jr. and Selmer M. Johnson. It uses fewer comparisons in the worst case than the best previously known algorithms, binary insertion sort and merge sort, and for 20 years it was the sorting algorithm with the fewest known comparisons. Although not of practical significance, it remains of theoretical interest in connection with the problem of sorting with a minimum number of comparisons. The same algorithm may have also been independently discovered by Stanisław Trybuła and Czen Ping. (en) |
| dbo:wikiPageID |
58128725 (xsd:integer) |
| dbo:wikiPageLength |
11348 (xsd:nonNegativeInteger) |
| dbo:wikiPageRevisionID |
1054542888 (xsd:integer) |
| dbo:wikiPageWikiLink |
dbr:Power_of_two dbr:Insertion_sort dbr:L._R._Ford_Jr. dbr:Lower_bound dbr:Stanisław_Trybuła dbr:Closed-form_expression dbr:Comparison_sort dbr:Computer_science dbc:Comparison_sorts dbc:Sorting_algorithms dbc:1959_in_computing dbr:Recurrence_relation dbr:Hybrid_algorithm dbr:Merge_sort dbr:Selmer_M._Johnson dbr:Sorting_number dbr:Worst_case_analysis dbr:Binary_search |
| dbp:wikiPageUsesTemplate |
dbt:OEIS dbt:R dbt:Reflist dbt:Sorting |
| dct:subject |
dbc:Comparison_sorts dbc:Sorting_algorithms dbc:1959_in_computing |
| rdfs:comment |
Merge Insertion (auch bekannt als Ford-Johnson-Algorithmus) ist ein rekursives, vergleichsorientiertes Sortierverfahren, das mit weniger Vergleichen als Mergesort auskommt. (de) In computer science, merge-insertion sort or the Ford–Johnson algorithm is a comparison sorting algorithm published in 1959 by L. R. Ford Jr. and Selmer M. Johnson. It uses fewer comparisons in the worst case than the best previously known algorithms, binary insertion sort and merge sort, and for 20 years it was the sorting algorithm with the fewest known comparisons. Although not of practical significance, it remains of theoretical interest in connection with the problem of sorting with a minimum number of comparisons. The same algorithm may have also been independently discovered by Stanisław Trybuła and Czen Ping. (en) |
| rdfs:label |
Merge Insertion (de) Merge-insertion sort (en) |
| owl:sameAs |
wikidata:Merge-insertion sort dbpedia-de:Merge-insertion sort dbpedia-fa:Merge-insertion sort https://global.dbpedia.org/id/5jDHG |
| prov:wasDerivedFrom |
wikipedia-en:Merge-insertion_sort?oldid=1054542888&ns=0 |
| foaf:isPrimaryTopicOf |
wikipedia-en:Merge-insertion_sort |
| is dbo:wikiPageRedirects of |
dbr:Ford-Johnson_algorithm dbr:Merge-insert_sort dbr:Ford–Johnson_algorithm |
| is dbo:wikiPageWikiLink of |
dbr:Comparison_sort dbr:Ford-Johnson_algorithm dbr:Merge-insert_sort dbr:Ford–Johnson_algorithm |
| is foaf:primaryTopic of |
wikipedia-en:Merge-insertion_sort |