Anonymous user
Talk:Permutations by swapping: Difference between revisions
→Does "Python: recursive" fit this task?
(→bear in mind?: A particular algo. needs it.) |
|||
Line 13:
:The task was written so that it could be a precursor to a method for calculating a [[Matrix arithmetic|determinant]] which needs a sequence of permutations and matching sign. (The sign is generated in the recursive solution Donal, and the outputs of both Python solutions match).
:Hopefully with these modifications the task should be in a fit state to be attempted in other languages. --[[User:Paddy3118|Paddy3118]] 20:31, 26 July 2012 (UTC)
::So the order of the output doesn't matter, as long as it is true that adjacent results differ by a swap of adjacent elements? How would one verify this easily? Perhaps a function to verify that the results satisfy this should be a part of the task, because it is insufficient to simply show that all the permutations are generated. --[[User:Spoon!|Spoon!]] 00:07, 3 August 2012 (UTC)
== bear in mind? ==
| |||