Talk:Permutations by swapping: Difference between revisions
→bear in mind?: new section
(→Does "Python: recursive" fit this task?: Tidied.) |
(→bear in mind?: new section) |
||
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)
== bear in mind? ==
Currently the task says "Such data are of use in generating the determinant of a square matrix and any functions created should bear this in mind."
But what does this mean? Functions do not have minds... (Or, being slightly less flip: this feels like it could easily become a modularity violation if it were refined into something testable.) --[[User:Rdm|Rdm]] 13:22, 30 July 2012 (UTC)
| |||