The Ford-Johnson algorithm still unbeaten for less than 47 elements (Q845913): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ipl.2006.09.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2081463407 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q30040050 / rank
 
Normal rank
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
    0 references
    29 January 2010
    0 references
    analysis of algorithms
    0 references
    sorting
    0 references
    merging
    0 references

    Identifiers