Talk:Long multiplication: Difference between revisions
→BigNum: The code is good, just in the wrong place. Task definition might need to change.
(→BigNum: clear - gmp example scheduled for deletion?) |
(→BigNum: The code is good, just in the wrong place. Task definition might need to change.) |
||
Line 30:
: I created this task for two reasons. First, I wanted to see what a programmatic implementation of the ''algorithm'' behind long multiplication might look like. Second, there are better arbitrary-precision multiplication algorithms out there, but before one looks at those, it helps to understand the simpler, less-efficient ones first. Creating this task is a stepping stone for implementing those better algorithms. Libraries implementing general-purpose arbitrary-precision math tasks are great, but this one was specifically about the algorithm in question. I'll update the task description to be a little more clear on the "this isn't something you should do in production code" point. --[[User:Short Circuit|Short Circuit]] 15:34, 26 February 2009 (UTC)
:: It is clear. But going further (implementing a whole algebra ...), I am not sure it would exemplify more. Anyway, does it make sense to show the GMP usage too, or the code should be eliminated? --[[User:ShinTakezou|ShinTakezou]] 14:32, 27 February 2009 (UTC)
::: IMO, the code ought to be kept, but it's in the wrong task. Perhaps we need more general arbitrary precision tasks, in addition to showing the individual algorithms. Or maybe the concept of a "task" needs to be further subdivided between "implement this algorithm" and "achieve this end." On the "implement this algorithm" pages, care should probably be taken to point out that there could be more idiomatic or best-practice methods of achieving the same goal, and include a link to corresponding "achieve this end" page.--[[User:Short Circuit|Short Circuit]] 19:45, 27 February 2009 (UTC)
| |||