[Quick Sort] 퀵 정렬

[Quick Sort] 퀵 정렬

#include <stdio.h>
 
int count;
 
void print(int *data, int size)
{
    int i;
 
    for (i = 0; i < size; i++) {
        printf("%d ", data[i]);
    }
    printf("\n");
}
 
void swap(int *first, int *second)
{
    int temp;
 
    temp = *first;
    *first = *second;
    *second = temp;
}
 
void quicksort(int *data, int start, int end)
{
    int temp;
    int pivot = end;
    int left = start;
    int right = end;
 
    while (right > left) {
        while (data[left] < data[pivot] && left < right) { left++; }
        while (data[right] >= data[pivot] && left < right) { right--; }
 
        if (left == right) {
            swap(&data[left], &data[pivot]);
            pivot = left;
        }
        else { swap(&data[left], &data[right]); }
    }
 
    if (pivot > start) { quicksort(data, start, pivot - 1); }
    if (end > pivot) { quicksort(data, pivot + 1, end); }
}
 
int main(void)
{
    int n, i;
    int input[100];
 
    scanf("%d", &n);
 
    for (i = 0; i < n; i++) {
        scanf("%d", &input[i]);
    }
 
    quicksort(input, 0, n - 1);
 
    print(input, n);
 
    return 0;
}
 
 

[참고] https://ko.wikipedia.org/wiki/%ED%80%B5_%EC%A0%95%EB%A0%AC

[참고] http://www.tipssoft.com/bulletin/board.php?bo_table=FAQ&wr_id=66