Internal Sorting
Internal Sorting is a sorting method that operates entirely within the main memory of a computer, distinguishing it from external sorting techniques by not requiring data to be stored or accessed from external storage during the sorting process.
18
Publications
633
Citations
39
Authors
24
Institutions
Publications per year
2017–2026
2
Parents
18
Implementing Quicksort programs
Robert Sedgewick · Communications of the ACM · 1978 · 290 citations
Lutz Wegner, Jukka Teuhola · IEEE Transactions on Software Engineering · 1989 · 28 citations
1–5 of 18
39
1
h-index
1
h-index
1
h-index
1
h-index
1
h-index
1–5 of 39
24
IBM (United States)
Armonk, United States
2 h-index
4 publications
151 citations
University of Kassel
Kassel, Germany
1 h-index
1 publications
28 citations

Australian National University
Canberra, Australia
1 h-index
2 publications
38 citations
Argonne National Laboratory
Lemont, United States
1 h-index
1 publications
21 citations

The Royal Melbourne Hospital
Melbourne, Australia
1 h-index
1 publications
12 citations
Agriculture and Agri-Food Canada
Ottawa, Canada
1 h-index
6 publications
72 citations

University of Helsinki
Helsinki, Finland
1 h-index
3 publications
42 citations

University of Ilorin
Ilorin, Nigeria
1 h-index
1 publications
16 citations
1–8 of 24
3 publications · 322 citations
3
h-index
JACM · 2 publications · 49 citations
2
h-index
2 publications · 68 citations
2
h-index
TSE · 2 publications · 42 citations
2
h-index
1 publications · 17 citations
1
h-index
1–5