=>
Enter integer number 3: 3
EXECUTE GCD
Result:
Enter integer number 3: 3
EXECUTE GCD
Result:1
Number 1
2
Number 2
4
Number 3 Result
6
2
}
return a;
}
Note:
Number
2
1
1 Number 2
4
2
Number 3 Result
6
3
2
1
Hint: Function to find the greatest common divisor of 2 integers a, b
private int GCD(int a, int b) {
while (a != b) {
if (ab) aa- b;
else b = b - a;
If a, b, c, result are not displayed after pressing the "EXECUTE GCD" button, 0.5 points will be deducted.
If every time you press the "EXECUTE GCD" button with the required data, you only replace the existing data line on the table, 0.5 points will be deducted.
Question 3:
IMPORTANT bofore you stort doing your solution MUST do the following stones
+ 115%
Zoom
Close
