You are viewing a single comment's thread from:
RE: Computation Contest #9 [2 SBI]
https://github.com/billyb2/quantum-developer-contests/blob/master/comp-contest-%239.html
Saves as much computation power as possible by limiting the amount of operations.
Also works for negative multiplication.
Unfortuantely, it's slows down for much larger numbers, and is in general slower since it runs in the browser. It tries to improve efficiency as well as possible, however, by having adding the larger number to itself instead of just picking the first number.
What you did is just implementing "the intuitive algorithm of simple repeated addition" which I mentioned in the problem which is as you correctly discovered very slow because you need
number2additions.You need to find something better.
By the way I ignore the speed differences of individual languages in these contests, because the algorithm would still be slow in any other language.
Thanks for the information, I'll work on redoing my answer now!