Showing papers on "Bitonic sorter published in 1969"

Algorithm 347: an efficient algorithm for sorting with minimal storage [M1]

Abstract: The real procedure gauss computes the area under the left-hand portion of the normal curve. Algorithm 209 [3] may be used for this purpose. If f < 0 or if dr1 < 1 or if dr2 < 1 then exit to the label error occurs. National Bureau of Standards formulas 26.6.4, 26.6.5, and 26.6.8 are used for computation of the statistic, and 26.6.15 is used for the approximation [2]. Thanks to Mary E. Rafter for extensive testing of this procedure and to the referee for a number of suggestions. begin if dfl < 1 V dr2 < 1 Vf < 0.0 then go to error; if f = 0.0 then prob := 1.0 else begin real fl, f2, x, ft, vp; fl := dfl; f2 := dr2; fl := 0.0; x := f2/(f2+flXf); vp := fl +f2-2.0; if 2 X (dfl+2) = dfl A dfl ~ maxn then begin realxx; xx := 1.0-x; for fl := fl-2.0 step-2.0 until 1.0 do begin vp := vp-2.0; ft := xx X vp/fl X (1.0+fl) end; ft := x 1\" (0.5X f2) X (1.O+fl) end else if 2 X (dr2 + 2) = dr2/S df2 =< maxn then begin for f2 := f2-2.0 step-2.0 until 1.0 do begin vp := vp-2.0; ft := x X vp/]2 X (1.O+ft) end ; ft := 1.0-(1.O-x)1\" (0.5X fl) X (1.O+ft) end else if dr1 \"4-dr2 <= maxn then begin real theta, sth, eth, sis, ets, a, b, xi, gamma; theta := arctan(sqrt(fl Xf /f2)) ; sth := sin(theta); cth := eos(theta); sts := sthl\"2; cts: = cthl'2; a := b := 0.0; if dr2 > 1 then begin for f2 := ./'2-2.0 step-2.0 until 2.0 do a := cts X (f2-1.0)/f2 X (1.0+a); a := sth X cth × (1.0+a) end ; a := thela + a; if dfl > 1 then begin for fl := fl-2.0 step-2.0 until 2.0 do begin vp := vp-2.0; b := sts X vp/fl X (1.0+b)