Anonymous user
Talk:Permutations with repetitions: Difference between revisions
Is the Mathematica solution correct?
(→REXX implementation limits: added another variant of REXX version 2. -- ~~~~) |
(Is the Mathematica solution correct?) |
||
Line 1:
==Mathematica solution incorrect?==
The task description says combination must be produced one at a time.
The Mathematica solution uses Tuples, which return a list of all permutations at once.
Is this a correct solution?
--[[User:Soegaard|Soegaard]] ([[User talk:Soegaard|talk]]) 14:16, 21 May 2013 (UTC)
==REXX implementation limits==
Line 6 ⟶ 12:
For Regina REXX 3.3, 3.4, 3.5, REXX gives a SYNTAX error:
:::::: Error
For Regina REXX 3.6, 3.7, REXX "crashes" somewhere less than a statement length of 1932,
Line 19 ⟶ 25:
For what's it worth, I believe REXX should raise the SYNTAX condition.
[The reason I mention the older versions of Regina REXX is that Regina REXX<br>virtual
<br>memory leak), so the use of the older Regina release is forced in lieu of a fix.
For PC/REXX and Personal REXX, it depends on what the RXISA ('''SET''' environmental variable).
<br>These
:::::: Error
<br>
:::::: Memory full: symbol
:::::: Error
somewhere between
It should be noted that most people use the maximum for the RXISA (which is
As far as I can tell,
<br>and that is probably true of CMS REXX and TSO REXX (it's been too long since I used those
<br>
::::::::::: -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 20:
----
==another variant of the
This REXX version:
* simplifies many statements
Line 53 ⟶ 58:
* eliminates an extra ''';''' (semicolon) from the INTERPRET clause
* eliminates the need for counting the permutations
<br>If any of these improvements could/would be of use, that's fine. I plan to delete this entry in a couple of weeks. -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 04:
<lang rexx>/*REXX*/ parse arg n m s names
if n='' then n=
do k=
else parse var names e.k names
end /*k*/
a=''
do i=
a=a'z=e.d1'
do j=
a=a';say z'copies(";end",m)
if m==
interpret a
say n**m 'permutations'</lang>
|