R. J. Ord-Smith

Learn More
b e g i n p := sqrt(z); d := 0.5 X z X p; p := 1 p e n d e l s e b e g i n d : = z X z ; p : = w X z e n d ; y := 2 X w / z ; for j := b + 2 s t e p 2 u n t i l n do b e g i n d := (1 + a / ( j -2 ) ) X d X z; p := i f a = 1 t h e n p + d X y / ( j 1 ) e l s e ( p + w ) X z e n d j; y := w X z; z := 2/z; b := n 2; for i := a + 2 s t e p 2 u n t i l m do b e(More)
ALGORITHM 308 GENERATION OF PERMUTATIONS IN PSEUDOLEXICOGRAPHIC ORDER [G6] R. J. ORD-SMIT:H (Recd. 11 Nov. 1966, 1 Dec. 1966, 28 Dee. 1966 and 27 Mar. 1967) Computing Laboratory, University of Bradford, England i f first t h e n b e g i n first := f a l s e ; go t o label e n d ; c o m m e n t the above is the in i t ia l iza t ion process; loop: i f q[k] =(More)
~DITOR : This letter concerns the paper entitled "An Algorithm for Generating Permutations" by G. G. Langdon Jr. [Comm. ACM 10 (May 1967), 298]. Although the algorithm given is simple to describe, its efficiency in terms of the number of transpositions required to generate a complete set of K! permutations is very poor. A number of simple and efficient(More)
  • 1