Sorting Data of Arbitrary Structure in Memory

Sort data having an organization or structure not supported by one of the subprograms in Chapter 18.1 . For example, data having more than one key to determine the sorted order. The subprogram INSORT in Chapter 18.3 here has similar functionality to GSORTP and is more efficient if the data are initially partly ordered, or the ordering criterion is expensive.
This software is part of the MATH77/mathc90 collection here.

Get Documentation: pdf ps dvi : For info. on C usage also see: pdf ps dvi (Because of our limited bandwidth, we request that you save this documentation if you may want to reread it.)
Data type: software
Language: f77 c
Operating System: any
Computer: any

How Compressed: tar.gz .zip
End of line convention: Unix(LF) Windows(CRLF) Mac(CR)
Type of use: Most uses (includes testing for possible use) Classroom use Research making comparisons with other codes of this type Hobby use
Review the code license Instructions after downloading Download alternate version of amach

Single user price for "base package" = $10 + for clean source (optional) $10 + for optional support $20.

For pricing information on more general usage fill out the following form. (Note that any number >254 gives rights for an unlimited number of users.) And even though you really don't want to know the details of the pricing scheme you can view it here. Note that all prices quoted are subject to change.

Include price for clean source: No Yes
Support for 1 year (Bug fixes are free): No support Yes support
Number of coders/developers:
Number of free (or internal) copies of your code distributed with our binaries:
Number of free (or internal) copies of your code distributed with our default source:
Number of charged-for copies of your code distributed with our binaries:
Number of charged-for copies of your code distributed with our default source:

The "mom" entry allows you to ask questions, make comments, see those of others, see ratings, the authors, etc.