Hybrid Sorting Models

Hybrid Sorting Models is a computational sorting framework that integrates two or more distinct sorting algorithms within a single cohesive strategy, dynamically selecting or combining them based on input characteristics to optimize overall efficiency and performance.

5

Publications

84

Citations

11

Authors

6

Institutions

Publications per year

2017–2026

1

Authors

11

  1. HM
    Henk Meijer

    Queen's University, Canada

    1 publications · 24 citations

    1

    h-index

  2. MB
    Mohammed Bey Ahmed Khernache

    Université de Bretagne Sud, France

    1 publications · 11 citations

    1

    h-index

  3. MV
    M. van der Nat

    University of Amsterdam, Netherlands

    1 publications · 14 citations

    1

    h-index

  4. DJ
    Daniel J. Phaneuf

    North Carolina State University, United States

    1 publications · 14 citations

    1

    h-index

  5. SG
    Selim G. Akl

    Queen's University, Canada

    1 publications · 24 citations

    1

    h-index

1–5 of 11

Venues

  1. Information Processing Letters

    2 publications · 38 citations

    2

    h-index

  2. American Journal of Agricultural Economics

    1 publications · 14 citations

    1

    h-index

1–2