C#版本快速排序

快速排序实现原理

①先从队尾开始向前扫描且当low < high时,如果a[high] > tmp,则high–,但如果a[high] < tmp,则将high的值赋值给low,即arr[low] = a[high],同时要转换数组扫描的方式,即需要从队首开始向队尾进行扫描了
②同理,当从队首开始向队尾进行扫描时,如果a[low] < tmp,则low++,但如果a[low] > tmp了,则就需要将low位置的值赋值给high位置,即arr[low] = arr[high],同时将数组扫描方式换为由队尾向队首进行扫描.
③不断重复①和②,知道low>=high时(其实是low=high),low或high的位置就是该基准数据在数组中的正确索引位置.

public static void quicksort(int[] arr,int low,int high)
        {
            if (low < high)
            {
                int index = getIndex(arr, low, high);
                quicksort(arr, low, index - 1);
                quicksort(arr, index + 1, high);
            }
        }
        public static int getIndex(int[] arr,int low,int high)
        {
            int tmp = arr[low];
            while (low < high)
            {
                while(low<high && arr[high] >= tmp)
                {
                    high--;
                }
                arr[low] = arr[high];
                while(low<high && arr[low] <= tmp)
                {
                    low++;
                }
                arr[high] = arr[low];
            }
            arr[low] = tmp;
            return low; 
        }