By Topic

Transferable FORTRAN Subroutine for Rapid Extended Sorting

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)

A transferable, utility grade, FORTRAN subroutine is described which sorts lists of arbitrary length and simultaneously resequences up to ten additional lists so as to retain a one-to-one correspondence between the elements of these additional lists and those of the list being sorted. Lists within lists may be sorted. A simple CALL permits all options and parameters to be specified. The code is based on the algorithm SHELLSORT.

Published in:

Computers, IEEE Transactions on  (Volume:C-19 ,  Issue: 3 )