Talk:Permutations/Rank of a permutation: Difference between revisions

Content added Content deleted

Inline

Revision as of 04:19, 27 October 2012

Python: Recursions as iterations

Thanks spoon for making the change, but are we now too far from the Myrvold & Ruskey paper that the functions are based on? An alternative is too add your update as a separate set of examples, but that is up to you - I can go either way.

I do like your use of randrange. Neat :-)
--Paddy3118 09:47, 26 October 2012 (UTC)

I have changed them back, but kept the unrankers as loops, but kept them as close to the original code as possible.

By the way, the previous use of randint was wrong. randint(0, perms) generates numbers from 0 to perms (inclusive), like randrange(perms+1). --Spoon! 04:19, 27 October 2012 (UTC)

@@ Line 4: / Line 4: @@
 I do like your use of randrange. Neat :-)<br>--[[User:Paddy3118|Paddy3118]] 09:47, 26 October 2012 (UTC)
+:I have changed them back, but kept the unrankers as loops, but kept them as close to the original code as possible.
+:By the way, the previous use of <code>randint</code> was wrong. <code>randint(0, perms)</code> generates numbers from 0 to perms (inclusive), like <code>randrange(perms+1)</code>. --[[User:Spoon!|Spoon!]] 04:19, 27 October 2012 (UTC)