SABER
|
Public Member Functions | |
recursive subroutine | quick_sort_integer (n, left_end, right_end, list, order) |
Sort an integer subvector. More... | |
recursive subroutine | quick_sort_real (n, left_end, right_end, list, order) |
Sort a real subvector. More... | |
Definition at line 24 of file tools_qsort.F90.
recursive subroutine tools_qsort::quick_sort::quick_sort_integer | ( | integer, intent(in) | n, |
integer, intent(in) | left_end, | ||
integer, intent(in) | right_end, | ||
integer, dimension(n), intent(inout) | list, | ||
integer, dimension(n), intent(inout) | order | ||
) |
Sort an integer subvector.
[in] | n | Input vector size |
[in] | left_end | Left end of the vector |
[in] | right_end | Right end of the vector |
[in,out] | list | Vector to sort |
[in,out] | order | Positions of the elements in the original order |
Definition at line 91 of file tools_qsort.F90.
recursive subroutine tools_qsort::quick_sort::quick_sort_real | ( | integer, intent(in) | n, |
integer, intent(in) | left_end, | ||
integer, intent(in) | right_end, | ||
real(kind_real), dimension(n), intent(inout) | list, | ||
integer, dimension(n), intent(inout) | order | ||
) |
Sort a real subvector.
[in] | n | Input vector size |
[in] | left_end | Left end of the vector |
[in] | right_end | Right end of the vector |
[in,out] | list | Vector to sort |
[in,out] | order | Positions of the elements in the original order |
Definition at line 153 of file tools_qsort.F90.