[C] 퀵 정렬

#include <stdio.h>
#include <string.h>

void Swap(int* A, int* B)
{
    int Temp = *A;
    *A = *B;
    *B = Temp;
}

int Partition(int DataSet[], int Left, int Right)
{
    int First = Left;
    int Pivot = DataSet[First];

    ++Left;

    while (Left <= Right)
    {
        while (DataSet[Left] <= Pivot && Left < Right)
        {
            ++Left;
        }
        while (DataSet[Right] >= Pivot && Left <= Right)
        {
            --Right;
        }
        if (Left < Right)
            Swap(&DataSet[Left], &DataSet[Right]);
        else
            break;
    }

    Swap(&DataSet[First], &DataSet[Right]);
    return Right;
}

void QuickSort(int DataSet[], int Left, int Right)
{
    // Left가 Right 보다 크면 동작하지 않아도 된다.
    if (Left < Right)
    {
        int Index = Partition(DataSet, Left, Right);
        QuickSort(DataSet, Left, Index - 1);
        QuickSort(DataSet, Index + 1, Right);
    }
}

int main()
{
    int DataSet[] = { 6, 4, 2, 3, 1, 5 };
    int Length = sizeof(DataSet) / sizeof(DataSet[0]);
    int i = 0;

    QuickSort(DataSet, 0, Length - 1);

    for (i = 0; i < Length; i++)
    {
        printf("%d", DataSet[i]);
    }

    printf("\n");
    return 0;
}