Try to optimize the following code with constant folding int y = 4; int w = 3; int z = 0; W = y-6; while (x-y > 0) { y =

[correctanswer]

Try To Optimize The Following Code With Constant Folding Int Y 4 Int W 3 Int Z 0 W Y 6 While X Y 0 Y 1 (12.04 KiB) Viewed 64 times

Try to optimize the following code with constant folding int y = 4; int w = 3; int z = 0; W = y-6; while (x-y > 0) { y = y + 1; if (x >= y) { Z = W; } else { z = 0; } } return z;