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
Parents
5
1–5 of 5
11
1
h-index
1
h-index
1
h-index
1
h-index
1
h-index
1–5 of 11
6

Université de Bretagne Sud
Lorient, France
1 h-index
3 publications
33 citations
University of Management and Technology
Lahore, Pakistan
1 h-index
3 publications
63 citations

Pennsylvania State University
State College, United States
1 h-index
1 publications
14 citations
Leiden University
Leiden, The Netherlands
1 h-index
1 publications
14 citations
Queen's University
Kingston, Canada
1 h-index
2 publications
48 citations
North Carolina State University
Raleigh, United States
1 h-index
1 publications
14 citations
University of Delaware
Newark, United States
1 publications
10 citations
University of Illinois Urbana-Champaign
Urbana, United States
1 publications
10 citations
1–8 of 6
2 publications · 38 citations
2
h-index
1 publications · 14 citations
1
h-index
1–2