very Ugent ........10 more min on net

[R K Singh]

will plz anyone will tell me wjtz goimng on here ???
int k = 1;
int i = ++k + k++ + + k ;
TIA

[Jennifer Wallace]

++k + k++ + + k
just happened to be around the same Question in
Khalid A Mughal's book ...
Evaluated as ...
(++k) + (k++) + (+k)
U might find this discussion useful ..
http://www.javaranch.com/ubb/Forum24/HTML/000775.html

[Rick Reumann]

Originally posted by ravish kumar:
will plz anyone will tell me wjtz goimng on here ???
int k = 1;
int i = ++k + k++ + + k ;
TIA

Ok I could be wrong here but you have to know that prefix and postfix operations are done before math operations and also the associativity that prefix unary operations are done right to left and then both postfix unary operations and normal math operations are done left to right.
So you end up with it first looking like this:
int i = (++k) + (k++) + (+k)
so then the first ++k is evaluted which is set to 2. Now since k is 2 the left associativity takes place setting k++ which means (k++) will evaluate to 2 but remember afterwards k is now 3 so in (+k) it's just doing (+3). You end up then with:
2 + 2 + 3 = 7.
Someone correct me if I'm wrong.

[R K Singh]

thanks ..
now I can sleep ...

[Rick Reumann]

Originally posted by Jennifer Wallace:
++k + k++ + + k
just happened to be around the same Question in
Khalid A Mughal's book ...
Evaluated as ...
(++k) + (k++) + (+k)
U might find this discussion useful ..
http://www.javaranch.com/ubb/Forum24/HTML/000775.html

Wow, thanks for that link. That shortcut maha ana provided for figuring out the solutions to these kind of problems was really awesome! (Doesn't necessarily help you really figure out what is going on but it sure is great. It eliminates having to know what is going on with associativity and the pre/post operations). With the tip you will see there applied to this problem would be:
i = (++k) + (k++) + (+k)//last + doesn't matter
i = (2)2 + 2(3) + 3
now ignore all the braces info so you have:
i = 2 + 2 + 3
i = 7 !!!
Read the link provided to find out how to do that. Good stuff (IMHO)