lasrt(3)

🌸 NAME 🌸

lasrt β€” lasrt: sort vector. This is the lasrt(3) page from the Library Functions Manual, bestie. πŸ’–

✨ SYNOPSIS ✨

πŸ’« Functions πŸ’«

  • subroutine dlasrt (id, n, d, info) β€” DLASRT sorts numbers in increasing or decreasing order.
  • subroutine slasrt (id, n, d, info) β€” SLASRT sorts numbers in increasing or decreasing order.

🌈 Detailed Description 🌈

Okay so this page is the docs zone for the LAPACK sort subroutines, and the full breakdown lives down in Function Documentation. Let’s get into it. 🫢

πŸ‘‘ Function Documentation πŸ‘‘

πŸŽ€ subroutine dlasrt (character id, integer n, double precision, dimension( * ) d, integer info)

DLASRT sorts numbers in increasing or decreasing order.

🧚 Purpose

Sort the numbers in D in increasing order if ID = 'I', or in decreasing order if ID = 'D'.

Use Quick Sort, reverting to Insertion sort on arrays of size <= 20. Dimension of STACK limits N to about 2**32.

🌸 Parameters

  • ID β€” ID is CHARACTER*1; = 'I': sort D in increasing order; = 'D': sort D in decreasing order.
  • N β€” N is INTEGER; the length of the array D.
  • D β€” D is DOUBLE PRECISION array, dimension (N). On entry, the array to be sorted. On exit, D has been sorted into increasing order (D(1) <= ... <= D(N)) or into decreasing order (D(1) >= ... >= D(N)), depending on ID.
  • INFO β€” INFO is INTEGER; = 0: successful exit; < 0: if INFO = -i, the i-th argument had an illegal value.

πŸ’œ Author

  • Univ. of Tennessee
  • Univ. of California Berkeley
  • Univ. of Colorado Denver
  • NAG Ltd.

Definition at line 87 of file dlasrt.f.


πŸ¦‹ subroutine slasrt (character id, integer n, real, dimension( * ) d, integer info)

SLASRT sorts numbers in increasing or decreasing order.

πŸ“ Purpose

Sort the numbers in D in increasing order if ID = 'I', or in decreasing order if ID = 'D'.

Use Quick Sort, reverting to Insertion sort on arrays of size <= 20. Dimension of STACK limits N to about 2**32.

🌺 Parameters

  • ID β€” ID is CHARACTER*1; = 'I': sort D in increasing order; = 'D': sort D in decreasing order.
  • N β€” N is INTEGER; the length of the array D.
  • D β€” D is REAL array, dimension (N). On entry, the array to be sorted. On exit, D has been sorted into increasing order (D(1) <= ... <= D(N)) or into decreasing order (D(1) >= ... >= D(N)), depending on ID.
  • INFO β€” INFO is INTEGER; = 0: successful exit; < 0: if INFO = -i, the i-th argument had an illegal value.

πŸ’œ Author

  • Univ. of Tennessee
  • Univ. of California Berkeley
  • Univ. of Colorado Denver
  • NAG Ltd.

Definition at line 87 of file slasrt.f.

πŸ’Œ Author πŸ’Œ

Generated automatically by Doxygen for LAPACK from the source code.


Signed, sealed, sorted: this footer tea is LAPACK Version 3.12.0, tagged as lasrt(3). The footer doesn’t give a separate date, so I’m not gonna invent one, bestie β€” periodt. πŸ’…βœ¨

πŸ“¦ where this page comes from