Timeline for Alone in a Couple implementation in Java
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 3, 2018 at 14:24 | comment | added | Anirudh Thatipelli | @DarkWiiPlayer, that's a really cool trick. Bit manipulation makes a lot of tasks easy. | |
| Aug 3, 2018 at 14:23 | comment | added | Anirudh Thatipelli | @Peter Taylor, thanks for you code-review. I will keep in mind to follow your suggestions. | |
| Aug 1, 2018 at 12:52 | history | edited | Peter Taylor | CC BY-SA 4.0 |
added 2 characters in body
|
| S Aug 1, 2018 at 11:52 | history | suggested | DarkWiiPlayer | CC BY-SA 4.0 |
Added examples to explain the math-lingo :)
|
| Aug 1, 2018 at 11:14 | review | Suggested edits | |||
| S Aug 1, 2018 at 11:52 | |||||
| Aug 1, 2018 at 11:09 | comment | added | DarkWiiPlayer |
For those who don't know: If you XOR a number A with any other number B twice, you get A again. If you XOR 0 with a number, you get that number. You can chain these operations in any order (commutativity), so for example, 0 xor 3 xor 4 xor 3 equals 0 xor 4 xor 4 xor 3, which is 3, because 0 xor 4 xor 4 is 0 xor twice with the same value and 0 xor 3 equals 3. Another way to explain it is that 4 xor 4 equals 0, this 0 xor 4 xor 4 xor 3 equals 0 xor 0 xor 3, so it ends up being 3.
|
|
| Aug 1, 2018 at 10:57 | history | edited | Peter Taylor | CC BY-SA 4.0 |
added 827 characters in body
|
| Aug 1, 2018 at 10:48 | history | answered | Peter Taylor | CC BY-SA 4.0 |