Anonymous user
Talk:Permutations by swapping: Difference between revisions
→Does "Python: recursive" fit this task?: Tidied.
(→Does "Python: recursive" fit this task?: Yep. But the task wording might need clarification.) |
(→Does "Python: recursive" fit this task?: Tidied.) |
||
Line 9:
: ''"Each permutation in the sequence that it generates differs from the previous permutation by swapping two adjacent elements of the sequence."''
Do I need to make clear that the program does not have to generate using swaps - only that the above holds true? --[[User:Paddy3118|Paddy3118]] 20:11, 26 July 2012 (UTC)
:Yep the task description did need tidying up, which I have started.
: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)
| |||