1 Introduction
2 Algorithms
2.1 Galloping Merges
3 Pingpong Powersort (Few moves)
4 Virtual-Memory Powersort (Almost Inplace)
4.1 Implementation considerations
5 Evaluation
6 Results
7 Conclusion
References
A Further optimisations
B CPU specifications
C Compiler specs