Timeline for Reversed Binary Numbers
Current License: CC BY-SA 3.0
4 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Jan 6, 2015 at 22:14 | comment | added | Johnny | You can generally count on the compiler to do the obvious optimizations like using shifts instead of multiply/divide. No need to rewrite arithmetic as bit shifts just to eke out a little extra performance if it is going to make your code any harder to read. In this case, however, since he really does want to do bit shifts, using the bit shift operators makes perfect sense and adds to the readability of the code. But if he were doing arithmetic and wanted to multiply a number by 2, he should use multiplication instead of trying to out optimize the compiler by using bit shifting. | |
Jan 6, 2015 at 16:39 | history | edited | Edward | CC BY-SA 3.0 |
added a few more points
|
Jan 6, 2015 at 15:44 | history | edited | Edward | CC BY-SA 3.0 |
added 698 characters in body
|
Jan 6, 2015 at 15:38 | history | answered | Edward | CC BY-SA 3.0 |