Java数组排序

java几种常见的排序方式

package com.zc.fuxi;


import org.junit.Test;

import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;

public class Test1 {
    Integer[] arr = {6, 8, 10, 1, 7, 4, 3};

    //正常排序
    @Test
    public void test() {
        Integer a= 12;
        if(a instanceof Integer){
            System.out.println("hahahha");
        }
        Arrays.sort(arr);
        System.out.println(Arrays.toString(arr));
        //从大到小
        ArrayList<Integer> list = new ArrayList<Integer>(Arrays.asList(arr));
        Collections.reverse(list);
        Object[] arrr = list.toArray();
        System.out.println(Arrays.toString(arrr));
    }

    //冒泡排序
    @Test
    public void test1() {
        int temp;
        for (int i = 0; i < arr.length - 1; i++) {
            for (int j = i + 1; j < arr.length; j++) {
                if (arr[i] > arr[j]) {
                    temp = arr[i];
                    arr[i] = arr[j];
                    arr[j] = temp;
                }
            }
        }
        System.out.println(Arrays.toString(arr));
    }

    //插入排序
    @Test
    public void test2() {
        int j, i, temp;
        for (i = 1; i < arr.length; i++) {
            temp = arr[i];
            for (j = i - 1; j >= 0; j--) {
                if (arr[j] > temp) {
                    arr[j + 1] = arr[j];
                } else {
                    break;
                }
            }
            arr[j + 1] = temp;
        }
        System.out.println(Arrays.toString(arr));
    }

    //选择排序
    @Test
    public void test3() {
        int i, j, index;
        for (i = 0; i < arr.length; i++) {
            index = i;
            for (j = i + 1; j < arr.length; j++) {
                if (arr[j] < arr[index]) {
                    index = j;
                }
            }
            int temp = arr[i];
            arr[i] = arr[index];
            arr[index] = temp;
        }
        System.out.println(Arrays.toString(arr));
    }
}