Hello, I been working at this for about 30 minutes now and can't seem to get it. This part is called One-Way selection. Here is the question...
Here is the code the provide
Your Code here...
Now my question is how wold you find which one has the lowest amount?
Given the integer variables x , y , and z , write a fragment of code that assigns the smallest of x , y , and z to another integer variable min .
Assume that all the variables have already been declared and that x , y , and z have been assigned values).
Assume that all the variables have already been declared and that x , y , and z have been assigned values).
Code:
1 int main() { 2 int x, y, z, min;
Code:
5 6 return 0; 7 }
Now my question is how wold you find which one has the lowest amount?
Comment