i=i++ + ++i;
j++ + ++j;
k=k++ + k++ + ++k;
All these Statements have compiler Dependent Output, As they violet
sequence point rule ( here value of a variable is modified two or more
times between two successive sequence points.)
Standard does not specify the exact order of execution of these type
;
}
}
}
On Tue, Jan 10, 2012 at 10:42 AM, priyanka jaggi
priyankajag...@gmail.comwrote:
@ankur : in this question, the elements of the array are continuous
i think the solution of shravan reddy is correct and works for negative
nos too.
--
You received this message
Given an array (length n), we need to find the subarray (length k) such
that the sum of the first j elements of the subarray equals the sum of the
remaining (k-j) elements of the subarray.
For e.g.
Array: 2,2,13,4,7,3,8,12,9,1,5
Output: 4,7,3,8,12,9,1 [4+7+3+8=12+9+1]
Could this be done with a
@ankur : in this question, the elements of the array are continuous
i think the solution of shravan reddy is correct and works for negative nos
too.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to
