选择排序

public class XuanZePaiXv {
    public static void main(String[] args) {
        int[] shu=new int[]{354,687,3468,54,723,1,86};
        for (int i=0;i<shu.length-1;i++){
            for (int j=i+1;j<shu.length;j++){
                if (shu[i]>shu[j]){
                    int temp=shu[j];
                    shu[j]=shu[i];
                    shu[i]=temp;
                }
            }
        }
        for (int i=0; i <shu.length;i++){
            System.out.println(shu[i]);
        }
    }

 }

 

通过j和i之后的数进行比较，较大的来替换第i个数的方式来排序

转载于:https://www.cnblogs.com/KeepCalmAndNeverSayNever/p/10543349.html