int quick_sort(int left,int right,int *array1)

{

int x = left, y = right;

int tmp;

int pivot = array1[left + right / 2];

while (x <= y)

{

while (array1[x] < pivot)

{

x++;

}

while (array1[y] > pivot)

{

y--;

}

if (x <= y)

{

tmp = array1[x];

array1[x] = array1[y];

array1[y] = tmp;

x++;

y--;

}

}

if (left < y)

{

quick_sort(left, y, array1);

}

if (x <= right)

{

quick_sort(x, right, array1);

}

}


array1은 배열로 중복없는 난수가 들어있습니다...