Java算法笔记01：冒泡排序

package SuanFa;




public class Bubble {
    

    public static void sort(Comparable[] a){
        for(int i=a.length-1;i>0;i--){//代表的是循环多少次,下面的代表两两相邻进行比较

            for(int j=0;j
                //比较索引j和索引j+1处的值
                if (greater(a[j],a[j+1])){
                    exch(a,j,j+1);
                }
            }
        }
    }

    

    private static boolean greater(Comparable v,Comparable w){
        return v.compareTo(w)>0;


    }
    

    private static void exch(Comparable[] a,int i,int j){
        Comparable temp;
        temp=a[i];
        a[i]=a[j];
        a[j]=temp;
    }
}

package SuanFa;

import java.lang.reflect.Array;
import java.util.Arrays;

public class BubbleTest {
    public static void main(String[] args) {
        Integer[] arr={4,5,6,3,2,1};
        Bubble.sort(arr);
        System.out.println(Arrays.toString(arr));
    }
}