我的快速排序未测试

void QuickSort(int arr[], int size)
{
    if(size == 0 || size == 1)
    {
        return;
    }
    int value = arr[0];
    int start = 1;
    int end = size-1;
    while(true)
    {
        if(start>end)
            return;
        while(arr[start]<=value&& start<=end)
        {
            start++;
        }
        while(arr[end]>value && 1 <end)
        {
            end--;
        }
        if(start<end)//swap
        {
            int temp = arr[start];
            arr[start]=arr[end];
            arr[end]=temp;            
        }
    }
}

貌似有点问题，用C#写了个版本

 public static int QuickSortPart(int[] a, int start, int end)
        {


            if (end - start < 1)
                return -1;
            int point = start;
            start = start + 1;

            while (true)
            {
                if (start > end)
                {
                    int temp = a[point];
                    a[point] = a[end];
                    a[end] = temp;
                    return end;
                }
                for (; a[start] <= a[point] && start <= end; start++) ;
                for (; a[end] > a[point] && 1 < end; end--) ;
                if (start < end)
                {
                    int temp = a[start];
                    a[start] = a[end];
                    a[end] = temp;
                }
            }
        }
        public static void QS(int[] a, int start, int end)
        {
            int point = QuickSortPart(a, start, end);
            if (point == -1)
                return;
            QS(a, start, point - 1);
            QS(a, point + 1, end);
        }
        static void Main(string[] args)
        {
            //int[] op1 = new int[] { 3, 6, 4, 2 };
            //QS(op1, 0, op1.Length - 1);

            //Print(op1);}

 

public static int QuickSortPart(int[] a, int start, int end)
        {


            if (end - start <= 1)
                return -1;
            int point = start;
            start = start + 1;

            while (true)
            {
                if (start >= end)
                {
                    int temp = a[point];
                    a[point] = a[end];
                    a[end] = temp;
                    return end;
                }
                for (; a[start] <= a[point] && start <= end; start++) ;
                for (; a[end] > a[point] && 1 < end; end--) ;
                if (start < end)
                {
                    int temp = a[start];
                    a[start] = a[end];
                    a[end] = temp;
                }
            }
        }
        public static void QS(int[] a, int start, int end)
        {
            int point = QuickSortPart(a, start, end);
            if (point == -1)
                return;
            QS(a, start, point - 1);
            QS(a, point + 1, end);
        }
        static void Main(string[] args)
        {
            int[] op1 = new int[] { 3, 6, 4, 2 };
            QS(op1, 0, op1.Length - 1);

            Print(op1);
}