The C/C++ programs reported on this page have been written by Svante Carlsson (Luleå University of Technology), Jyrki Katajainen (University of Copenhagen), Tomi Pasanen (University of Turku), and Jukka Teuhola (University of Turku). You can redistribute the programs and/or modify them under the terms of the GNU General Public License. There is no warranty for the programs. If you have comments concerning the programs, do not hesitate to contact the authors of the corresponding research paper.
J. Katajainen, T. Pasanen, and J. Teuhola, Practical in-place mergesort, Nordic Journal of Computing 3 (1996) 27-40.
Integer sorting programs (the MIX model):
Polymorphic sorting programs (the qsort model):
This header file defines the necessary macros to count the number of comparisons and assignments performed.
S. Carlsson, J. Katajainen, and J. Teuhola, In-place linear probing sort, DIKU Report 92/3, Department of Computer Science, University of Copenhagen (1992).