| ??? 06/15/09 11:41 Modified: 06/15/09 11:42 Read: times |
#166083 - an algorithmic puzzle |
How to find out effectively, if an integer variable has exactly one 1 in its binary representation?
JW |
| Topic | Author | Date |
| an algorithmic puzzle | 01/01/70 00:00 | |
| For example | 01/01/70 00:00 | |
| that fast? | 01/01/70 00:00 | |
| Other interesting tricks in base-2: | 01/01/70 00:00 | |
| yuk | 01/01/70 00:00 | |
| this depends on your definition of logic | 01/01/70 00:00 | |
| Its a good solution | 01/01/70 00:00 | |
| Why huge? | 01/01/70 00:00 | |
| Infinite? | 01/01/70 00:00 | |
| Yes | 01/01/70 00:00 | |
| Offset | 01/01/70 00:00 | |
| this was supposed to be fun, Kai | 01/01/70 00:00 | |
| I always take you seriously... | 01/01/70 00:00 | |
pure software | 01/01/70 00:00 |