In-place Sorting
In-Place Sorting is a sorting algorithm that belongs to the class of algorithms performing reorganization of elements within a fixed data structure, distinguished by its use of only a constant amount of additional memory space apart from the input array.
14
Publications
351
Citations
25
Authors
18
Institutions
Publications per year
2017–2026
4
Parents
14
Jyrki Katajainen, Tomi Pasanen, Jukka Teuhola · 1996 · 52 citations
Self-sorting in-place FFT algorithm with minimum working space
Zhuo Qian, Chao Lu, Myoung An et al. · IEEE Transactions on Signal Processing · 1994 · 47 citations
In-place sorting with fewer moves
Jyrki Katajainen, Tomi Pasanen · Information Processing Letters · 1999 · 28 citations
1–5 of 14
25
3
h-index
2
h-index
2
h-index
2
h-index
1
h-index
1–5 of 25
18

University of Pisa
Pisa, Italy
3 h-index
3 publications
58 citations
Turku Centre for Computer Science
Turku, Finland
2 h-index
2 publications
80 citations
University of Pavol Jozef Šafárik
Košice, Slovakia
2 h-index
2 publications
38 citations
University of Copenhagen
Copenhagen, Denmark
2 h-index
2 publications
80 citations

University of Turku
Turku, Finland
1 h-index
1 publications
52 citations
Case Western Reserve University
Cleveland, United States
1 h-index
3 publications
66 citations
University of Stuttgart
Stuttgart, Germany
1 h-index
1 publications
18 citations

Sun Yat-sen University
Guangzhou, China
1 h-index
3 publications
60 citations
1–8 of 18
IJACSA · 1 publications · 17 citations
1
h-index
1 publications · 56 citations
1
h-index
1 publications · 47 citations
1
h-index
1 publications · 20 citations
1
h-index
JEA · 1 publications · 18 citations
1
h-index
1–5