java冒泡算法和选择排序法

package test.auto;

import java.util.Arrays;

import org.apache.bcel.generic.FieldGenOrMethodGen;

public class Maopao0807{

    public static void main(String[] args) {
        //冒泡，每个相邻进行比较
        int a[]={ 6, 5, 3, 1, 8, 7, 2, 4 , 0};
        for (int i = 0 ;i <a.length-1;i++){
            for(int j  =0 ; j < a.length-i-1;j++){
                if (a[j]<a[j+1]){
                    int m = a[j];
                    a[j]=a[j+1];
                    a[j+1]=m;
                }
            }
        }
        System.out.println(Arrays.toString(a)+a[1]);
        
        //选择排序法,一个数依次和后面进行比较
        int b[]={ 6, 5, 3, 1, 8, 7, 2, 4 , 0};
        for (int i =0 ;i<b.length;i++){
            for (int j =i;j<b.length;j++){
                if (b[i]<b[j]){
                    int m=b[j];
                    b[j]=b[i];
                    b[i]=m;
                }
            }
                
        }
        System.out.println(Arrays.toString(b)+b[1]);
    }

}