#Unity _ 快速排序

using System.Collections;
using System.Collections.Generic;
using UnityEngine;

public class 快速排序 : MonoBehavIoUr
{
    void Start()
    {
        快速排序Test(arr, 0, arr.Length - 1);
    }
    public int[] arr = new int[] { 1, 3, 2, 4, 5, 8, 7, 22, 32, 18, 17, 43, 21, 33 };
    public void 快速排序Test(int[] arr, int left, int right)
    {
        if (left >= right)
        {
            return;
        }
        int leftIndex = left;
        int rightIndex = right;
        int midindex = left;
        int temp;
        
        while (leftIndex < rightIndex)
        {
            while (leftIndex < rightIndex && arr[rightIndex] >= arr[midindex])
            {
                rightIndex--;
            }
            temp = arr[midindex];
            arr[midindex] = arr[rightIndex];
            arr[rightIndex] = temp;
            midindex = rightIndex;

            while (leftIndex < rightIndex && arr[leftIndex] <= arr[midindex])
            {
                leftIndex++;
            }
            temp = arr[midindex];
            arr[midindex] = arr[leftIndex];
            arr[leftIndex] = temp;
            midindex = leftIndex;
        }
        快速排序Test(arr, left, midindex - 1);
        快速排序Test(arr, midindex + 1, right);
    }
}