The Ford-Johnson algorithm still unbeaten for less than 47 elements (Q845913): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q30040050, #quickstatements; #temporary_batch_1711094041063 |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Computing the number of mergings with constraints / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Tournament Problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5618383 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Optimal merging of 2 elements with n elements / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4349924 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Ford-Johnson Sorting Algorithm Is Not Optimal / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4144789 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4411410 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: New results in minimum-comparison sorting / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Merging of 4 or 5 elements with n elements / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the Optimality of Linear Merge / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5657656 / rank | |||
Normal rank |
Latest revision as of 09:58, 2 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The Ford-Johnson algorithm still unbeaten for less than 47 elements |
scientific article |
Statements
The Ford-Johnson algorithm still unbeaten for less than 47 elements (English)
0 references
29 January 2010
0 references
analysis of algorithms
0 references
sorting
0 references
merging
0 references