#include <stdio.h>

void Swap(int arr[], int m, int n)
{
        if (m == n) return;

        arr[m] += arr[n];
        arr[n] = arr[m] - arr[n];
        arr[m] = arr[m] - arr[n];
}

void output(int arr[], int len)
{
        for (int i=0; i<len; ++i)
        {
                printf("%d ", arr[i]);
        }
        printf("\n");
}

int Partition(int arr[], int s, int e)
{
        int k = arr[s];

        while (s < e)
        {
                while(s < e && k <= arr[e]) --e;
                Swap(arr, s, e);

                while(s < e && k >= arr[s]) ++s;
                Swap(arr, s, e);
        }

        return s;
}

void QuickSort(int arr[], int s, int e)
{
        if (s < e)  //条件必要
        {
                int i = Partition(arr, s, e);
                QuickSort(arr, s, i-1);
                QuickSort(arr, i+1, e);
        }
}

int main(int argc, char *argv[])
{
        printf("Hello World\n");
        int array[] = {12, 33, 2, 34, 29, 101, 7, 23, 48, 100};
        int len = sizeof(array)/sizeof(array[0]);


        QuickSort(array, 0, len-1);

        output(array, len);
}