Timeline for compute number of 1 bits in a binary representation of a number
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 17, 2020 at 9:04 | history | edited | CommunityBot |
Commonmark migration
|
|
| Jan 10, 2012 at 10:09 | comment | added | Ali1S232 | my bad! by the way java use the same algorithm as gnibbler suggested | |
| Jan 10, 2012 at 10:06 | comment | added | user unknown | Yes, I see - 10 M longs/s with bitcount as Javacode on the same machine. Btw.: I count 24 operations for ratchet, not 18. | |
| Jan 10, 2012 at 9:23 | comment | added | Ali1S232 | the other answers are much more faster, for example ratchet only computes 18 operations for 64bit integer, while you code need at least 128 operations for same size int. | |
| Jan 10, 2012 at 6:41 | history | edited | user unknown | CC BY-SA 3.0 |
added 11 characters in body
|
| Jan 10, 2012 at 6:20 | history | answered | user unknown | CC BY-SA 3.0 |