A variant of the Ford-Johnson algorithm that is more space efficient (Q846008): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q58001488, #quickstatements; #temporary_batch_1708557319324
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 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.11.017 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1998757079 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Electronic Data Sorting / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tournament Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4057549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4507509 / 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: Merging of 4 or 5 elements with n elements / rank
 
Normal rank

Latest revision as of 09:59, 2 July 2024

scientific article
Language Label Description Also known as
English
A variant of the Ford-Johnson algorithm that is more space efficient
scientific article

    Statements

    A variant of the Ford-Johnson algorithm that is more space efficient (English)
    0 references
    0 references
    0 references
    0 references
    29 January 2010
    0 references
    algorithms
    0 references
    analysis of algorithms
    0 references
    optimal sorting
    0 references

    Identifiers