FORCES
FORtran lib for Comp. Env. Sys.
|
Partial insertion sort ranking,. More...
Public Member Functions | |
subroutine | d_inspar (xdont, nord) |
subroutine | r_inspar (xdont, nord) |
subroutine | i_inspar (xdont, nord) |
Partial insertion sort ranking,.
Sorts partially XVALT, bringing the NORD lowest values at the begining of the array. This subroutine uses insertion sort, limiting insertion to the first NORD values. It does not use any work array and is faster when NORD is very small (2-5), but worst case behavior can happen fairly probably (initially inverse sorted). In many cases, the refined quicksort method is faster.
[in,out] | integer(i4)/real(sp,dp), dimension(:) :: XVALT | Array to be ranked. |
[in] | integer(i4) :: NORD | Number of ranked elements from beginning of array. |
Definition at line 429 of file mo_orderpack.f90.
subroutine mo_orderpack::inspar::d_inspar | ( | real(kind = dp), dimension (:), intent(inout) | xdont, |
integer(kind = i4), intent(in) | nord | ||
) |
Definition at line 3741 of file mo_orderpack.f90.
subroutine mo_orderpack::inspar::i_inspar | ( | integer(kind = i4), dimension (:), intent(inout) | xdont, |
integer(kind = i4), intent(in) | nord | ||
) |
Definition at line 3831 of file mo_orderpack.f90.
subroutine mo_orderpack::inspar::r_inspar | ( | real(kind = sp), dimension (:), intent(inout) | xdont, |
integer(kind = i4), intent(in) | nord | ||
) |
Definition at line 3786 of file mo_orderpack.f90.