toms347

toms347, a Fortran77 code which implements ACM toms algorithm 347, for sorting an integer array.

The text of many ACM toms algorithms is available online through ACM: https://www.acm.org/pubs/calgo or NETLIB: https://www.netlib.org/toms/index.html.

Usage:

call sort ( a, ii, jj )
where A is the array to be sorted, II and JJ are the first and last indices of A to be sorted.

Licensing:

The information on this web page is distributed under the MIT license.

Languages:

toms347 is available in a Fortran77 version.

Related Data and Programs:

toms347_test

combo, a Fortran90 library which includes a number of sorting routines.

SUBPAK, a Fortran77 library which includes a number of sorting routines for various data types.

SUBSET, a Fortran77 library which includes a number of sorting routines.

Reference:

  1. Richard Singleton,
    Algorithm 347: An Efficient Algorithm for Sorting with Minimial Storage,
    Communications of the ACM,
    Volume 12, Number 3, pages 185-186, March 1969.

Source Code:

Last revised on 09 November 2023.