Stable Sorting
Stable Sorting is a sorting algorithm that preserves the relative order of elements with equal keys in the sorted output as they appeared in the input sequence.
14
Publications
365
Citations
38
Authors
23
Institutions
Publications per year
2017–2026
2
Parents
14
A method to investigate the stability of a sorting map
G Blancher, B. Clavier, C. Egoroff et al. · Food Quality and Preference · 2011 · 71 citations
Fast Stable Merging and Sorting in Constant Extra Space
B.-C. Huang, Michael A. Langston · The Computer Journal · 1992 · 29 citations · Full text
1–5 of 14
38
1
h-index
1
h-index
1
h-index
1
h-index
1
h-index
1–5 of 38
23
Sandia National Laboratories California
Livermore, United States
1 h-index
1 publications
14 citations
University of Illinois Urbana-Champaign
Urbana, United States
1 h-index
2 publications
52 citations
Givaudan (Switzerland)
Vernier, Switzerland
1 h-index
1 publications
71 citations
Purdue University West Lafayette
West Lafayette, United States
1 h-index
2 publications
28 citations
University of Delaware
Newark, United States
1 h-index
1 publications
14 citations
University of Tennessee at Knoxville
Knoxville, United States
1 h-index
1 publications
29 citations
Givaudan (Netherlands)
Naarden, Netherlands
1 h-index
2 publications
142 citations

Bar-Ilan University
Ramat Gan, Israel
1 h-index
2 publications
72 citations
1–8 of 23
JACM · 1 publications · 20 citations
1
h-index
1 publications · 13 citations
1
h-index
1 publications · 21 citations
1
h-index
1 publications · 29 citations
1
h-index
Conference · 1 publications · 36 citations
1
h-index
1–5