对数组进行快速排序

static void Main(string[] args)
{
int[] arr = new int[10];
Random r = new Random();
for(int i = 0; i < 10; i++)
{
arr[i]=r.Next(1, 100);
}
Console.Write(“排序前的数组元素：”);
foreach(var element in arr)
{
Console.Write(element+" ");
}
Console.WriteLine();
Console.Write(“排序后的数组元素为：”);

        //46 31 10 4 73 6 18 29 47 51
        //快速排序
        quickSort(arr, 0, arr.Length - 1);
        for (int i = 0; i < arr.Length; i++)
        {
            Console.Write(arr[i] + " ");
        }
        Console.WriteLine();
        Console.ReadKey(true);
    }

    private static void quickSort(int []arr,int low,int high)
    {
        if (low < high)//前提条件是low<hign
        {
            int index = getIndex(arr,low,high);
            quickSort(arr, 0, index - 1);
            quickSort(arr, index + 1, high);
        }
    }

    private static int getIndex(int []arr,int low,int high)
    {
        int temp = arr[low];//将数组第一个数给临时变量temp,并找到temp的索引位置
        while (low < high)
        {
            while (low < high && arr[high] >= temp)
            {
                high--;
            }
            arr[low] = arr[high];
            while (low < high && arr[low] <= temp)
            {
                low++;
            }
            arr[high] = arr[low];
        }
        arr[low] = temp;
        return low;
    }