Talk:Generalised floating point addition: Difference between revisions

Line 56:
 
: Ok, I have updated the J implementation to generate the full sequence. But that leaves me with my previous question, so I will repeat it for this updated implementation: ''Is this an acceptable implementation? If so, could the task description be changed to allow it? If not, perhaps you could expand on the "why" to explain why I need to do something different?'' --[[User:Rdm|Rdm]] 14:54, 30 October 2011 (UTC)
 
To be honest I don't know J, hence cannot read it, so at the end of the day you are the judge of your own code. The task ''test case'' requires "Perform the multiplication of 81 by repeated additions". The repeated pattern "12345679" was picked to maximise the varieties of "carries" performed during addition, hence the requirement "Perform the multiplication of 81 by repeated additions" is a significant part of the ''test case''. At the end of the day you are the judge of your own code, and visa-versa. [[User:NevilleDNZ|NevilleDNZ]] 21:18, 30 October 2011 (UTC)