- Abstract
Sort an integer array using the Shell Sort algorithm.
- Required_Reading
None.
- Brief_I/O
VARIABLE I/O DESCRIPTION
-------- --- --------------------------------------------------
ndim I Dimension of the array.
array I/O The array.
- Detailed_Input
ndim is the number of elements in the array to be sorted.
array on input, is the array to be sorted.
- Detailed_Output
array on output, contains the same elements, sorted
in increasing order. The actual sorting is done
in place in array.
- Parameters
None.
- Particulars
The Shell Sort Algorithm is well known.
- Examples
Let array contain the following elements:
99
33
55
44
-77
66
Then after a call to shelli_c, the array would be ordered as
follows:
-77
33
44
55
66
99
- Restrictions
None.
- Exceptions
Error free.
1) If ndim < 2, this routine does not modify the array.
- Files
None.
- Author_and_Institution
N.J. Bachman (JPL)
I.M. Underwood (JPL)
- Literature_References
None.
- Version
-CSPICE Version 1.0.0, 08-JUL-2002 (NJB) (IMU)
- Index_Entries
shell sort an integer array
- Link to routine source