Long multiplication: Difference between revisions
Content added Content deleted
m (→{{header|Dc}}) |
|||
| Line 1,930: | Line 1,930: | ||
Since Dc has arbitrary precision built-in, the task is no different than a normal multiplication: |
Since Dc has arbitrary precision built-in, the task is no different than a normal multiplication: |
||
<lang Dc>2 64^ 2 64^ *p</lang> |
<lang Dc>2 64^ 2 64^ *p</lang> |
||
{{incorrect|Dc|Dc |
{{incorrect|Dc|A Dc solution might be representing bignums as numerical strings and implement arithmetic functions on them.}} |
||
You would simulate having only fixed size integers just for implementing a multiplication simulating a bigger size? |
|||
Simulate overflow errors with Dc's arithmetic just for the sake of circumcoding it in the next layer? |
|||
For languages having fixed size integers and bignum support this task may make sense but not for Dc. |
|||
This example should be replaced by exactly this explanation.}} |
|||
=={{header|EchoLisp}}== |
=={{header|EchoLisp}}== |
||