importjava.util.Scanner;publicclass greatest_common_divisor {publicstaticvoidmain(String[]args){Scanner scanner =newScanner(System.in);System.out.println("请输入两个整数");int a =0, b =0,temp =0;
a = scanner.nextInt();
b = scanner.nextInt();if(a < b){//降序排序
temp = a;
a = b;
b = temp;}System.out.println("暴力枚举算法求"+ a +"和"+ b +"的最大公约数为:"+maxCDivisor_01(a,b));System.out.println("--------------------------------------------");System.out.println("欧几里得算法求"+ a +"和"+ b +"的最大公约数为:"+maxCdivisor_02(a,b));}staticint maxCDivisor_01 (int y,int x){//暴力枚举for(int id = x;id >=0;id--){if(y % id ==0&& x % id ==0){return id;}}return0;}staticint maxCdivisor_02 (int y,int x){//欧几里得算法 最大公约数 = 较小的数/两数的余数 致命缺陷就是算不了大素数if(x ==0){return y;}else{int temp = x;
x = y % x;
y = temp;returnmaxCdivisor_02(y,x);}}}
分别用穷举法和欧几里德算法实现求两个整数的最大公约数,并比较算法的效率。import java.util.Scanner;public class greatest_common_divisor { public static void main(String []args){ Scanner scanner = new Scanner(System.in); System.out.println("请输入两个整数"); int a = 0, b