include <stdio.h>

include "stdafx.h"

define N 7

void Print2(int *a)
{
for (int i = 0; i < N; i++)
{
printf("%d ", a[i]);
}
printf("\n");
}

void Sort(int *a, int left,int right)
{
if (left >= right)
{
return;
}

int i = left;
int j = right;
int key = a[i];

while (i<j)
{
    while (i<j && key <= a[j])
    {
        j--;
    }
    a[i] = a[j];

    while (i<j && key >= a[i])
    {
        i++;
    }
    a[j] = a[i];

}
a[i] = key;
Sort(a,left,i-1);
Sort(a,i+1 ,right);

}

void Sort2(int *data, int left, int right)
{
if (left >= right)
{
return;
}
int i = left;
int j = right;
int key = data[i];

while (i<j) //左邊和右邊的檢測(cè)沒(méi)有碰面
{
    //從右邊取一個(gè)蘿卜形成坑
    while (i<j && data[j]>key) //需要從右邊向左 直到發(fā)現(xiàn)一個(gè)比key小的蘿卜
    {
        j--;
    }
    data[i] = data[j];              //取出來(lái)填舊坑，形成新坑

    while (i<j && data[i]<key)     //從左邊取一個(gè)蘿卜形成坑
    {                                //需要從左向右 直到發(fā)現(xiàn)一個(gè)比key大的蘿卜
        i++;
    }
    data[j] = data[i];
}
data[i] = key;   //此時(shí) 在I左邊的都比它小，I 右邊的都比它大
Sort2(data, left, i - 1);
Sort2(data, i+1,right);

}

int main()
{
int a[7] = { 2,1,4,5,7,6,3 };
Sort2(a,0,N-1);
Print2(a);
}