Sort input integer array in place into ascending numerical order using quick sort. This algorithm works well for partially sorted arrays (which is usually the case here)
| Type | Intent | Optional | Attributes | Name | ||
|---|---|---|---|---|---|---|
| integer(kind=I4B), | intent(inout), | dimension(:) | :: | arr |
Sort input integer array by index in ascending numerical order using quicksort. If ind is supplied already allocated, we assume it is an existing index array (e.g. a previously sorted array). If it is not allocated, this subroutine swiftest_allocates it.
| Type | Intent | Optional | Attributes | Name | ||
|---|---|---|---|---|---|---|
| integer(kind=I4B), | intent(in), | dimension(:) | :: | arr | ||
| integer(kind=I4B), | intent(inout), | dimension(:), allocatable | :: | ind |
Sort input integer array by index in ascending numerical order using quicksort. If ind is supplied already allocated, we assume it is an existing index array (e.g. a previously sorted array). If it is not allocated, this subroutine swiftest_allocates it.
| Type | Intent | Optional | Attributes | Name | ||
|---|---|---|---|---|---|---|
| integer(kind=I4B), | intent(in), | dimension(:) | :: | arr | ||
| integer(kind=I8B), | intent(inout), | dimension(:), allocatable | :: | ind |
Sort input integer array by index in ascending numerical order using quicksort. If ind is supplied already allocated, we assume it is an existing index array (e.g. a previously sorted array). If it is not allocated, this subroutine swiftest_allocates it.
| Type | Intent | Optional | Attributes | Name | ||
|---|---|---|---|---|---|---|
| integer(kind=I8B), | intent(in), | dimension(:) | :: | arr | ||
| integer(kind=I8B), | intent(inout), | dimension(:), allocatable | :: | ind |
Sort input DP precision array in place into ascending numerical order using quicksort.
| Type | Intent | Optional | Attributes | Name | ||
|---|---|---|---|---|---|---|
| real(kind=SP), | intent(inout), | dimension(:) | :: | arr |
Sort input DP precision array by index in ascending numerical order using quicksort. If ind is supplied already allocated, we assume it is an existing index array (e.g. a previously sorted array). If it is not allocated, this subroutine swiftest_allocates it.
| Type | Intent | Optional | Attributes | Name | ||
|---|---|---|---|---|---|---|
| real(kind=SP), | intent(in), | dimension(:) | :: | arr | ||
| integer(kind=I4B), | intent(inout), | dimension(:), allocatable | :: | ind |
Sort input DP precision array in place into ascending numerical order using quicksort.
| Type | Intent | Optional | Attributes | Name | ||
|---|---|---|---|---|---|---|
| real(kind=DP), | intent(inout), | dimension(:) | :: | arr |
Sort input DP precision array by index in ascending numerical order using quick sort. This algorithm works well for partially sorted arrays (which is usually the case here). If ind is supplied already allocated, we assume it is an existing index array (e.g. a previously sorted array). If it is not allocated, this subroutine swiftest_allocates it.
| Type | Intent | Optional | Attributes | Name | ||
|---|---|---|---|---|---|---|
| real(kind=DP), | intent(in), | dimension(:) | :: | arr | ||
| integer(kind=I4B), | intent(inout), | dimension(:), allocatable | :: | ind |