version 1.7, 2010/12/21 13:53:33
|
version 1.8, 2011/11/21 20:42:59
|
Line 1
|
Line 1
|
|
*> \brief \b DLASRT |
|
* |
|
* =========== DOCUMENTATION =========== |
|
* |
|
* Online html documentation available at |
|
* http://www.netlib.org/lapack/explore-html/ |
|
* |
|
*> \htmlonly |
|
*> Download DLASRT + dependencies |
|
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/dlasrt.f"> |
|
*> [TGZ]</a> |
|
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/dlasrt.f"> |
|
*> [ZIP]</a> |
|
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/dlasrt.f"> |
|
*> [TXT]</a> |
|
*> \endhtmlonly |
|
* |
|
* Definition: |
|
* =========== |
|
* |
|
* SUBROUTINE DLASRT( ID, N, D, INFO ) |
|
* |
|
* .. Scalar Arguments .. |
|
* CHARACTER ID |
|
* INTEGER INFO, N |
|
* .. |
|
* .. Array Arguments .. |
|
* DOUBLE PRECISION D( * ) |
|
* .. |
|
* |
|
* |
|
*> \par Purpose: |
|
* ============= |
|
*> |
|
*> \verbatim |
|
*> |
|
*> Sort the numbers in D in increasing order (if ID = 'I') or |
|
*> in decreasing order (if ID = 'D' ). |
|
*> |
|
*> Use Quick Sort, reverting to Insertion sort on arrays of |
|
*> size <= 20. Dimension of STACK limits N to about 2**32. |
|
*> \endverbatim |
|
* |
|
* Arguments: |
|
* ========== |
|
* |
|
*> \param[in] ID |
|
*> \verbatim |
|
*> ID is CHARACTER*1 |
|
*> = 'I': sort D in increasing order; |
|
*> = 'D': sort D in decreasing order. |
|
*> \endverbatim |
|
*> |
|
*> \param[in] N |
|
*> \verbatim |
|
*> N is INTEGER |
|
*> The length of the array D. |
|
*> \endverbatim |
|
*> |
|
*> \param[in,out] D |
|
*> \verbatim |
|
*> D is DOUBLE PRECISION array, dimension (N) |
|
*> On entry, the array to be sorted. |
|
*> On exit, D has been sorted into increasing order |
|
*> (D(1) <= ... <= D(N) ) or into decreasing order |
|
*> (D(1) >= ... >= D(N) ), depending on ID. |
|
*> \endverbatim |
|
*> |
|
*> \param[out] INFO |
|
*> \verbatim |
|
*> INFO is INTEGER |
|
*> = 0: successful exit |
|
*> < 0: if INFO = -i, the i-th argument had an illegal value |
|
*> \endverbatim |
|
* |
|
* Authors: |
|
* ======== |
|
* |
|
*> \author Univ. of Tennessee |
|
*> \author Univ. of California Berkeley |
|
*> \author Univ. of Colorado Denver |
|
*> \author NAG Ltd. |
|
* |
|
*> \date November 2011 |
|
* |
|
*> \ingroup auxOTHERcomputational |
|
* |
|
* ===================================================================== |
SUBROUTINE DLASRT( ID, N, D, INFO ) |
SUBROUTINE DLASRT( ID, N, D, INFO ) |
* |
* |
* -- LAPACK routine (version 3.2) -- |
* -- LAPACK computational routine (version 3.4.0) -- |
* -- LAPACK is a software package provided by Univ. of Tennessee, -- |
* -- LAPACK is a software package provided by Univ. of Tennessee, -- |
* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- |
* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- |
* November 2006 |
* November 2011 |
* |
* |
* .. Scalar Arguments .. |
* .. Scalar Arguments .. |
CHARACTER ID |
CHARACTER ID |
Line 13
|
Line 101
|
DOUBLE PRECISION D( * ) |
DOUBLE PRECISION D( * ) |
* .. |
* .. |
* |
* |
* Purpose |
|
* ======= |
|
* |
|
* Sort the numbers in D in increasing order (if ID = 'I') or |
|
* in decreasing order (if ID = 'D' ). |
|
* |
|
* Use Quick Sort, reverting to Insertion sort on arrays of |
|
* size <= 20. Dimension of STACK limits N to about 2**32. |
|
* |
|
* Arguments |
|
* ========= |
|
* |
|
* ID (input) CHARACTER*1 |
|
* = 'I': sort D in increasing order; |
|
* = 'D': sort D in decreasing order. |
|
* |
|
* N (input) INTEGER |
|
* The length of the array D. |
|
* |
|
* D (input/output) DOUBLE PRECISION array, dimension (N) |
|
* On entry, the array to be sorted. |
|
* On exit, D has been sorted into increasing order |
|
* (D(1) <= ... <= D(N) ) or into decreasing order |
|
* (D(1) >= ... >= D(N) ), depending on ID. |
|
* |
|
* INFO (output) INTEGER |
|
* = 0: successful exit |
|
* < 0: if INFO = -i, the i-th argument had an illegal value |
|
* |
|
* ===================================================================== |
* ===================================================================== |
* |
* |
* .. Parameters .. |
* .. Parameters .. |