15.Java（排序）

排序

冒泡排序

package Test3;

import java.util.Arrays;

//冒泡排序！！！！！！！！！！！

public class Demo {
    public static void main(String[] args) {
        int[] arr = {24, 69, 80, 57, 13, 8, 9, 10, 2, 1, 1};
        get(arr);
    }

    private static void get(int[] arr) {
        //第一轮
        for (int i = 0; i < arr.length-1; i++) {
            if (arr[i]> arr[i+1]){
                int num= arr[i];
                arr[i] = arr[i+1];
                arr[i+1] = num;
            }
        }
        System.out.println(Arrays.toString(arr));

        //第二轮
        for (int i = 0; i < arr.length-2; i++) {
            if (arr[i]> arr[i+1]){
                int num= arr[i];
                arr[i] = arr[i+1];
                arr[i+1] = num;
            }
        }
        System.out.println(Arrays.toString(arr));

        //第三轮
        for (int i = 0; i < arr.length-3; i++) {
            if (arr[i]> arr[i+1]){
                int num= arr[i];
                arr[i] = arr[i+1];
                arr[i+1] = num;
            }
        }
        System.out.println(Arrays.toString(arr));
    }
}

我们可以优化一下：

package Test3;

import java.util.Arrays;

//冒泡排序！！！！！！！！！！！

public class Demo {
    public static void main(String[] args) {
        int[] arr = {24, 69, 80, 57, 13, 8, 9, 10, 2, 1, 1};
        get1(arr);
    }
    private static void get1(int[] arr) {
        for (int j = 0; j < arr.length-1; j++) {
        for (int i = 0; i < arr.length-1-j; i++) {
            if (arr[i]>arr[i+1]){
                int num=arr[i];
                arr[i] = arr[i+1];
                arr[i+1] = num;
            }
        }
    }
        System.out.println(Arrays.toString(arr));
    }

选择排序

package Test3;

import java.util.Arrays;

//选择排序！！！！！！！！！！
public class Demo1 {
    public static void main(String[] args) {
        int[] arr={24,69,80,57,13};
        get(arr);
    }

    private static void get(int[] arr) {
        //第一轮
        int index=0;
        for (int i = 1 + index; i < arr.length; i++) {
            if (arr[i]< arr[index] ) {
                int t= arr[i];
                arr[i]= arr[index];
                arr[index] = t;
            }
        }
        System.out.println(Arrays.toString(arr));

        //第二轮
        index=1;
        for (int i = 1 + index; i < arr.length; i++) {
            if (arr[i]< arr[index] ) {
                int t= arr[i];
                arr[i]= arr[index];
                arr[index] = t;
            }
        }
        System.out.println(Arrays.toString(arr));

        //第三轮
        index=2;
        for (int i = 1 + index; i < arr.length; i++) {
            if (arr[i]< arr[index] ) {
                int t= arr[i];
                arr[i]= arr[index];
                arr[index] = t;
            }
        }
        System.out.println(Arrays.toString(arr));

        //第四轮
        index=3;
        for (int i = 1 + index; i < arr.length; i++) {
            if (arr[i]< arr[index] ) {
                int t= arr[i];
                arr[i]= arr[index];
                arr[index] = t;
            }
        }
        System.out.println(Arrays.toString(arr));
    }
}

我们继续优化一下：

package Test3;

import java.util.Arrays;

//选择排序！！！！！！！！！！
public class Demo1 {
    public static void main(String[] args) {
        int[] arr={24,69,80,57,13};
        get1(arr);
    }

    private static void get1(int[] arr) {
        for (int index = 0; index < arr.length-1; index++) {
            for (int i = 1 + index; i < arr.length; i++) {
                if (arr[i]< arr[index] ) {
                    int t= arr[i];
                    arr[i]= arr[index];
                    arr[index] = t;
                }
            }
        }
        System.out.println(Arrays.toString(arr));
    }

插入排序

package Test3;

import java.util.Arrays;

//直接插入排序!!!!!!!!!
public class Demo3 {
    public static void main(String[] args) {
        int[] arr = {10, 3, 1, 6};
        get(arr);
    }
    private static void get(int[] arr) {
        for (int i = 0; i < arr.length; i++) {
            int j=i;
            while (j>0&& arr[j]< arr[j-1]){
                int t= arr[j];
                arr[j] = arr[j-1];
                arr[j-1] =t;
                j--;
            }
        }
        System.out.println(Arrays.toString(arr));
    }
}

当然也可以这样：

package Test3;

import java.util.Arrays;

//直接插入排序!!!!!!!!!
public class Demo3 {
    public static void main(String[] args) {
        int[] arr = {10, 3, 1, 6};
        gat1(arr);
    }
    private static void gat1(int[] arr) {
        for (int i = 1; i < arr.length; i++) {
            for (int j = i; j >0; j--) {
                if (arr[j]<arr[j-1]) {
                    int t= arr[j];
                    arr[j] = arr[j-1];
                    arr[j-1] =t;
                }
            }
        }
        System.out.println(Arrays.toString(arr));
    }
}

快速排序法：挖坑排序

package Test3;

import java.util.Arrays;

//快速排序法：挖坑填数
public class Demo4 {
    public static void main(String[] args) {
        int[] arr = {10, 3, 1, 6, 7, 65, 30, 20, 1, 0, 50, 30, 90, 200, 30, 80, 90};
        Test.test(arr,0,arr.length);
        System.out.println(Arrays.toString(arr));
    }
}

package Test3;

public class Test1 {
    private Test1(){}
    public  static void test1(int []arr,int start,int end){
        //分成左右俩区
        if (start<end){
            //对左右俩区进行递归调用
            int index=getIndex(arr,start,end);
            //对左区进行递归
            test1(arr, start, index-1);
            //对右区进行递归
            test1(arr, index+1, end);

        }
    }
    public static int getIndex(int[] arr, int start, int end) {
        int i=start;
        int j = end;
        int x=arr[i];
        while (i < j) {
            while (i < j&&arr[j]>x) {
                j--;
            }
            if (i < j) {
                arr[i] = arr[j];
                i++;
            }
            while (i < j&arr[i]<=x) {
                i++;
            }
            if (i < j) {
                arr[j] = arr[i];
                j--;
            }
        }
        arr[i] =x;
        return j;
    }
}

二分查找

package Test3;
//二分查找！！！！！
public class Demo5 {
    public static void main(String[] args) {
        int[]arr = {10,20,30,40,50,60,70,80,90,100};
        int index=get(arr,70);
        System.out.println(index);
    }

    private static int get(int[]arr, int ele) {
        int min=0;
        int max=arr.length-1;
        int center=(min+max)/2;

        while (min<=max){
            if (ele==arr[center]) {
                return center;
            }
            else if (ele<arr[center]){
                max=center-1;
            }
            else if (ele>arr[center]){
                min=center+1;
            }
            center=(min+max)/2;
        }
        return -1;
    }
}