冒泡排序（升序）

/**
 * @author: yekai  <br/>
 * Date: 2021/11/16:0:04  <br/>
 * Description:4 6 5 2 1 3 使用冒泡排序 顺序排列
 */
public class Main {
    public static void main(String[] args) {
        int[] a = { 4,6,5,2,1,3};
        int[] b = new int[6];
        b = sort(a);
        //输出
        for (int i = 0; i < b.length; i++) {
            System.out.print(b[i] + " ");
        }

    }

    //冒泡排序算法
    private static int[] sort(int[] a) {

        for (int i = 0; i < a.length; i++) {

            for (int j = 0; j < a.length-i-1; j++) {
                //如果大于就互换
                if(a[j]>a[j+1]){
                    int temp = a[j];
                    a[j] = a[j+1];
                    a[j+1] = temp;
                }
            }
        }
        return a;
    }

}