Technical note: Efficient sorting routines in FORTRAN 77

A problem faced which arises in many computing applications is that of sorting the entries in a list into ascending sequence of their values. Efficient algorithms for sorting long lists usually require recursive techniques and are not straightforward to program in a non-recursive language such as FO...

Full description

Bibliographic Details
Main Authors: Houlsby, G, Sloan, S
Format: Journal article
Language:English
Published: 1984