Discussion about math, puzzles, games and fun. Useful symbols: ÷ × ½ √ ∞ ≠ ≤ ≥ ≈ ⇒ ± ∈ Δ θ ∴ ∑ ∫ • π ƒ ¹ ² ³ °
 

You are not logged in.
Post a replyTopic review (newest first)
y = x XOR y
I suppose it might be interpreted different ways by different compilers, but my understanding of parenthesis is that inner most parens are always evaluated first, thats why i have doubled parens around x + y. So I'm PRETTY sure this would work on any correct compiler.
I'd be wary of using that one line solution, since it can be interpretted two different ways by the compiler. If it evaluates right to left then it will set x = y first, then subtract that from x + y, which is now y + y, and you'll end up with y = y and x = y. Of course, I realize that you aren't suggesting actually using such code, but I thought that should be pointed out.
the purpose of this puzzle is by no means to save memory or time, its just a puzzle for fun.
does this actually use less memory though? its still interesting to see things like this though is it possible to not use any extra memory? perhaps with a restriction on the values of the integers.
hehehe!
I was going to do inline assembly, bu then I remembered how much work it would be to look up register names and the like.
that was quick! good job, thedude!
int x = a;
here's something i thought of today at school 