SRC/dlasrt.f(3)

πŸ’– NAME πŸ’–

okay so bestie, welcome to SRC/dlasrt.f(3) β€” that's the page, and it's from the Library Functions Manual. The NAME itself is just SRC/dlasrt.f, and she's here to sort your numbers. iconic. ✨

✨ SYNOPSIS ✨

🧚 Functions/Subroutines 🧚

  • subroutine dlasrt (id, n, d, info) β€” DLASRT sorts numbers in increasing or decreasing order. πŸ’…

🌸 Function/Subroutine Documentation 🌸

🫢 subroutine dlasrt 🫢

   subroutine dlasrt (character id, integer n, double precision, dimension( * )
       d, integer info)

DLASRT sorts numbers in increasing or decreasing order. no cap, that's the whole job. πŸŽ€

πŸŽ€ 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. 🫢

πŸ’€ Author πŸ’€

Generated automatically by Doxygen for LAPACK from the source code.


and that's the whole page, bestie! LAPACK Version 3.12.0, SRC/dlasrt.f(3) β€” slay and bye πŸ’…πŸ’–

πŸ“¦ where this page comes from