Sorting Algorithms is an academic concept referring to a class of algorithms designed to arrange elements of a list or sequence into a specified order, distinguished by their systematic approach to comparing and rearranging data elements according to a defined ordering criterion.
1.8K
Publications
93.5K
Citations
3.2K
Authors
1.1K
Institutions
Publications per year
2017–2026
229
Publications
1.8K
Introduction to algorithms [2nd ed.]
Thomas H. Cormen · 2001 · 1.9K citations
Wisconsin Card Sorting Test manual
R. K. Heaton · Medical Entomology and Zoology · 1981 · 1.5K citations
The input/output complexity of sorting and related problems
Alok Aggarwal · Communications of the ACM · 1988 · 1.2K citations · Full text
1–5 of 1.8K
Authors
3.2K
- JS
10
h-index
- SR
10
h-index
- GG
10
h-index
- TH
10
h-index
- JI
10
h-index
1–5 of 3.2K
Institutions
1.1K
Carnegie Mellon University
Pittsburgh, United States
18 h-index
42 publications
3.2K citations
University of Illinois Urbana-Champaign
Urbana, United States
18 h-index
44 publications
2.3K citations
Centre National de la Recherche Scientifique
Paris, France
17 h-index
33 publications
1.7K citations
IBM (United States)
Armonk, United States
17 h-index
41 publications
2.8K citations
Tel Aviv University
Tel Aviv, Israel
17 h-index
36 publications
1.6K citations
University of California, Berkeley
Berkeley, United States
16 h-index
44 publications
1.6K citations
University of Waterloo
Waterloo, Canada
16 h-index
31 publications
1.5K citations
Massachusetts Institute of Technology
Cambridge, United States
15 h-index
30 publications
1.3K citations
1–8 of 1.1K
Venues
- SIAM Journal on Computing
46 publications · 4.8K citations
31
h-index
- Communications of the ACM
46 publications · 5.7K citations
29
h-index
- IEEE Transactions on Computers
46 publications · 2.3K citations
25
h-index
- Information Processing Letters
46 publications · 1.5K citations
21
h-index
- Journal of the ACM
JACM · 25 publications · 2.3K citations
20
h-index
1–5