//辗转相除法 递归实现publicclassDemo02{publicstaticvoidmain(String[] args){Demo02 demo =newDemo02();int num = demo.gcd(12,6);System.out.println("最大公约数:"+num);}//递归实现publicintgcd(int a,int b){if(b ==0)return a;elsereturngcd(b, a%b);}}//辗转相除法 基本方法实现publicclassDemo01{publicstaticvoidmain(String[] args){Scanner reader =newScanner(System.in);int n, m, r =1, temp, a;
n = reader.nextInt();
m = reader.nextInt();
a = n * m;//保证n是最大的if(n < m){
temp = n;
n = m;
m = temp;}//关键代码while(r !=0){
r = n % m;
n = m;
m = r;}System.out.print("最小公倍数:"+a / n +",最大公约数 :"+ n);}}//最小公倍数 = 两整数的乘积÷最大公约数
2.冒泡排序(i=0&i<length-1,j=0;j<legnth-1-i)
比较相邻的元素。如果第一个比第二个大,就交换他们两个
publicclassBubble_sort{publicstaticvoidmain(String[] args){//冒泡排序算法int[] arr=newint[]{10,21,8,16,7,23,12};//需进行length-1次冒泡for(int i =0; i < arr.length-1;i++){for(int j=0;j<arr.length-1-i;j++){if(arr[j]>arr[j+1]){int temp=arr[j];
arr[j]=arr[j+1];
arr[j+1]=temp;}}}System.out.println("从小到大排序后的结果是:");for(int i=0;i<arr.length;i++)System.out.print(arr[i]+" ");}}
3.选择排序(i=0&i<length-1, minIndex = i, j=i+1&j<length)