This is the common interface to a sorting routine. It performs the shell algorithm, not as fast as the quicksort for large numbers, but it seems that better for moderate numbers (around 100). Their possible interfaces are: subroutine sort(a [, ind]) real(real64),_OR_INTEGER, intent(inout) :: a(:) integer, intent(inout), optional :: ind(:) ! This routine sorts, from smallest to largest, the array a. ! If the integer array ind is present, it puts in it the indexing ! of the sorting, so that other arrays can be sorted according to ! the sorting of a. end subroutine sort.
More...
This is the common interface to a sorting routine. It performs the shell algorithm, not as fast as the quicksort for large numbers, but it seems that better for moderate numbers (around 100). Their possible interfaces are: subroutine sort(a [, ind]) real(real64),_OR_INTEGER, intent(inout) :: a(:) integer, intent(inout), optional :: ind(:) ! This routine sorts, from smallest to largest, the array a. ! If the integer array ind is present, it puts in it the indexing ! of the sorting, so that other arrays can be sorted according to ! the sorting of a. end subroutine sort.
subroutine sort(a, x) real(real64), intent(inout) :: a(:) real(real64),_OR_COMPLEX, intent(inout) :: x(:, : [, :]) ! This routine sorts, from smallest to largest, the array a. ! The real or complex array x, which may be two or three dimensional, ! is sorted according to the ordering of a. The last dimension of x ! must have the same size as a. end subroutine sort
Definition at line 149 of file sort.F90.