hpsolb.f File Reference

Go to the source code of this file.

Functions/Subroutines
subroutine	hpsolb (n, t, iorder, iheap)
	This subroutine sorts out the least element of t, and puts the remaining elements of t in a heap. More...

Function/Subroutine Documentation

hpsolb()

subroutine hpsolb	(	integer	n,
		double precision, dimension(n)	t,
		integer, dimension(n)	iorder,
		integer	iheap
	)

Parameters

n	On entry n is the dimension of the arrays t and iorder. On exit n is unchanged.
t	On entry t stores the elements to be sorted. On exit t(n) stores the least elements of t, and t(1) to t(n-1) stores the remaining elements in the form of a heap.
iorder	On entry iorder(i) is the index of t(i). On exit iorder(i) is still the index of t(i), but iorder may be permuted in accordance with t.
iheap	On entry iheap should be set as follows: iheap .eq. 0 if t(1) to t(n) is not in the form of a heap, iheap .ne. 0 if otherwise. On exit iheap is unchanged.

Definition at line 21 of file hpsolb.f.

Referenced by cauchy().

Here is the caller graph for this function: