Timeline for XOR multiplication
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 21, 2020 at 22:04 | comment | added | ceilingcat |
Suggest b%2 instead of (b&1)
|
|
| Jun 17, 2020 at 9:04 | history | edited | CommunityBot |
Commonmark migration
|
|
| May 16, 2015 at 8:23 | comment | added | CL- |
The inputs are non-negative so you can replace (b&1) with b%2 to save a further two bytes since % has the same left-to-right precedence level as *.
|
|
| May 16, 2015 at 1:35 | comment | added | Alex A. | Struck out 44 is still regular 44. :( | |
| May 16, 2015 at 0:18 | history | edited | BrainSteel | CC BY-SA 3.0 |
-6 bytes thanks to nimi
|
| May 16, 2015 at 0:14 | comment | added | BrainSteel | @nimi Ah, clever! I knew there was a way to get rid of that dumb parameter. I've got 38 bytes now. Thanks! | |
| May 15, 2015 at 22:40 | comment | added | nimi |
Why not a recursive version f(a,b)={return(b)?(b&1)*a^f(2*a,b/2):0;}?
|
|
| May 15, 2015 at 20:53 | history | answered | BrainSteel | CC BY-SA 3.0 |