java study(冒泡,选择,插入三种排序方式)

冒泡排序

package com.smile.test.sort.bubble;

/**
 * 冒泡排序  时间复杂度O(n^2)
 */

public class Bubble {
   
    static void sort(Comparable[] a){
   
        for (int i = a.length-1; i>0; i--){
   
            for (int j=0; j<i; j++){
   
                if(greater(a[j],a[j+1])){
   
                    changeIndex(a, j, j+1);
                }
            }

        }
    }
    private static boolean greater(Comparable a,Comparable b){
   
        return a.compareTo(b) > 0;
    }
    private static void changeIndex(Comparable[] a,int i,int j){
   
        Comparable temp;
        temp = a[i];
        a[i]