Timeline for Karatsuba Multiplication Implementation
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 1, 2018 at 13:52 | history | edited | micarlise | CC BY-SA 4.0 |
Clafified that the base case needs to be changed to produce the correct answer
|
| Aug 19, 2018 at 23:14 | history | edited | micarlise | CC BY-SA 4.0 |
clarification that the problem with previous answers is that they will not provide the correct answer for multiplication of two integers.
|
| Aug 19, 2018 at 23:07 | comment | added | micarlise |
@colidyre ==1 is not the correct recursion base case. Therefore, the previous answer's code examples does not actually give the correct answer for multiplying it's input numbers. I made some edits to my answer to clarify.
|
|
| Aug 19, 2018 at 23:05 | history | edited | micarlise | CC BY-SA 4.0 |
clarification that the problem with previous answers is that they will not provide the correct answer for multiplication of two integers.
|
| Aug 19, 2018 at 13:05 | review | Late answers | |||
| Aug 19, 2018 at 13:06 | |||||
| Aug 19, 2018 at 13:03 | comment | added | colidyre |
I can't really see an improvement in your code. You just replaced the ==1-conditions in the if-clause and as I can see, nothing else changed. Have I overseen something really important? Or is the change from ==1 to <3 the major part. Then, some explanations about this would be fine.
|
|
| Aug 19, 2018 at 12:50 | review | First posts | |||
| Aug 19, 2018 at 13:03 | |||||
| Aug 19, 2018 at 12:46 | history | answered | micarlise | CC BY-SA 4.0 |