TOMS347
An Efficient Algorithm for Sorting with Minimial Storage

TOMS347 is a FORTRAN77 library which implements ACM TOMS algorithm 347, for sorting an integer array.

The text of many ACM TOMS algorithms is available online through ACM: http://www.acm.org/pubs/calgo or NETLIB: http://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.

Languages:

TOMS347 is available in a FORTRAN77 version.

Related Data and Programs:

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:

• toms347.f, the source code.
• toms347.sh, commands to compile the source code.

Examples and Tests:

• toms347_prb.f, a sample calling program.
• toms347_prb.sh, commands to compile and run the sample program.
• toms347_prb_output.txt, the output from a run of the sample program.

List of Routines:

• SORT sorts an integer array.

You can go up one level to the FORTRAN77 source codes.