re: Permutations

Robert Hoogstraat — Fri, 28 Jan 2005 23:37:00 GMT

Here is another possible solution with little code:

* PERMUTATIONS
*
* def'n:
* If M = (n)P(r) = P(n):(r) denotes the number of
* permutations of (n) distinct things taken (r) at a time,
* -- M = n(n-1)(n-2)...(n-r+1) = n!/(n-r)!

Permutations( "12345" )

PROCEDURE Permutations ;
( ;
tvThings AS CHARACTER, ;
tvStatic AS CHARACTER, ;
tvN AS INTEGER ;
) AS VOID
LOCAL iX AS INTEGER
IF VARTYPE(tvStatic)="L"
* First time procedure called, preset missing parameters.
CLEAR
PUBLIC lnPermutation AS INTEGER
lnPermutation = 0
tvStatic = ""
tvN = LEN(tvThings)
ENDIF
FOR iX = 1 TO tvN
IF tvN > 2
Permutations( RIGHT( tvThings, tvN-1 ), tvStatic+LEFT(tvThings,1), tvN-1 )
ELSE
lnPermutation = lnPermutation + 1
? lnPermutation, tvStatic+tvThings
ENDIF
tvThings = SUBSTR(tvThings,2) + LEFT(tvThings,1)
ENDFOR
ENDPROC

Good site

Vilyamdn — Thu, 24 Jan 2008 04:20:10 GMT

<a href= http://index1.morun5.com >boy scout camp forestburg</a>