【算法】排序

package main;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.*;
import java.util.concurrent.ExecutorService;
import java.util.concurrent.Executors;
import java.util.concurrent.locks.Condition;
import java.util.concurrent.locks.Lock;
import java.util.concurrent.locks.ReentrantLock;

public class Main {
    public static void main(String[] args) {
        int[] array = {100, 0, 1, 2, 4, 3, 5, 4, 5, 6, 7, 8, 9, 10, 11, 12};

        //冒泡排序
        for (int i = 0; i < array.length; i++) {
            boolean flag = false;
            for (int j = 0; j < array.length - i - 1; j++) {
                if (array[j] > array[j + 1]) {
                    int temp = array[j];
                    array[j] = array[j + 1];
                    array[j + 1] = temp;
                    flag = true;
                }
            }
            if (flag) {
                break;
            }
        }
        System.out.println(Arrays.toString(array));

        int[] array_2 = {100, 0, 1, 2, 4, 3, 5, 4, 5, 6, 7, 8, 9, 10, 11, 12};
        //简单选择排序
        for (int i = 0; i < array.length; i++) {
            int loc = i;
            for (int j = i + 1; j < array.length; j++) {
                if (array_2[j] < array_2[loc]) {
                    loc = j;
                }
            }
            if (loc != i) {
                int temp = array_2[i];
                array_2[i] = array_2[loc];
                array_2[loc] = temp;
            }
        }
        System.out.println(Arrays.toString(array_2));

        int[] array_3 = {3,5,4,2,1,6,7,8};
        //快速排序
        quitSort(array_3,0,array_3.length-1);
        System.out.println(Arrays.toString(array_3));

    }

    static void quitSort(int[] array, int left, int right) {
        int i = left;
        int j = right;
        if (left >= right) {
            return;
        }
        int base = array[i];
        while (i < j) {
            while (i < j && array[j] >= base) {
                j--;
            }

            if (j > i) {
                array[i] = array[j];
            }
            while (i < j && array[i] <= base) {
                i++;
            }
            if (i < j) {
                array[j] = array[i];
            }
        }
        array[i] = base;
        quitSort(array,left,i-1);
        quitSort(array,i+1,right);
    }
}