GSP
Quick Navigator

Search Site

Unix VPS
A - Starter
B - Basic
C - Preferred
D - Commercial
MPS - Dedicated
Previous VPSs
* Sign Up! *

Support
Contact Us
Online Help
Handbooks
Domain Status
Man Pages

FAQ
Virtual Servers
Pricing
Billing
Technical

Network
Facilities
Connectivity
Topology Map

Miscellaneous
Server Agreement
Year 2038
Credits
 

USA Flag

 

 

Man Pages


Manual Reference Pages  -  SLAPST (l)

NAME

SLAPST - Define a permutation INDX that sorts the numbers in D in increasing order (if ID = ’I’) or in decreasing order (if ID = ’D’ )

CONTENTS

Synopsis
Purpose
Arguments

SYNOPSIS

SUBROUTINE SLAPST( ID, N, D, INDX, INFO )
    CHARACTER ID
    INTEGER INFO, N
    INTEGER INDX( * )
    REAL D( * )

PURPOSE

Define a permutation INDX that sorts 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.

ARGUMENTS

ID (input) CHARACTER*1
  = ’I’: sort D in increasing order;
= ’D’: sort D in decreasing order.
N (input) INTEGER
  The length of the array D.
D (input) REAL array, dimension (N)
  The array to be sorted.
INDX (ouput) INTEGER array, dimension (N).
  The permutation which sorts the array D.
INFO (output) INTEGER
  = 0: successful exit
< 0: if INFO = -i, the i-th argument had an illegal value
Search for    or go to Top of page |  Section l |  Main Index


ScaLAPACK version 1.7 SLAPST (l) 13 August 2001

Powered by GSP Visit the GSP FreeBSD Man Page Interface.
Output converted with manServer 1.07.