SABER
tools_qsort::quick_sort Interface Reference

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...
 

Detailed Description

Definition at line 24 of file tools_qsort.F90.

Member Function/Subroutine Documentation

◆ quick_sort_integer()

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.

Parameters
[in]nInput vector size
[in]left_endLeft end of the vector
[in]right_endRight end of the vector
[in,out]listVector to sort
[in,out]orderPositions of the elements in the original order

Definition at line 91 of file tools_qsort.F90.

◆ quick_sort_real()

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.

Parameters
[in]nInput vector size
[in]left_endLeft end of the vector
[in]right_endRight end of the vector
[in,out]listVector to sort
[in,out]orderPositions of the elements in the original order

Definition at line 153 of file tools_qsort.F90.


The documentation for this interface was generated from the following file: