LAMRG: will create a permutation list which will merge the elements of A (which is composed of two independently sorted sets) into a single set which is sorted in ascending order.
More...
LAMRG: will create a permutation list which will merge the elements of A (which is composed of two independently sorted sets) into a single set which is sorted in ascending order.
◆ la_dlamrg()
| la_lapack::lamrg::la_dlamrg |
◆ la_qlamrg()
| la_lapack::lamrg::la_qlamrg |
◆ la_slamrg()
| la_lapack::lamrg::la_slamrg |
The documentation for this interface was generated from the following file: