\uc2e4\ud589\ud658\uacbd : Visual C++ 6.0<\/p>\n
#include <stdio.h><\/p>\n
void quick_partition(int low, int high, int *pivotpoint);
void quick_sort(int low, int high);
void quick_swap(int *a, int *b);<\/p>\n
int S[10] = {10, 12, 14, 2, 6, 5, 9, 3, 7, 8}; \/\/ \uc815\ub82c\uc744 \uc6d0\ud558\ub294 \uc804\uc5ed\ubc30\uc5f4.<\/p>\n
int main()
{
int i;<\/p>\n
printf(“Before : “);
for(i = 0; i < 10; i++)
printf(“%d “, S[i]);
printf(“n”);<\/p>\n
quick_sort(0, 9);<\/p>\n
printf(“After : “);
for(i = 0; i < 10; i++)
printf(“%d “, S[i]);
printf(“n”);<\/p>\n
return 0;
}<\/p>\n
void quick_swap(int *a, int *b)
{
int temp;
temp = *a;
*a = *b;
*b = temp;
}<\/p>\n
void quick_sort(int low, int high)
{
int pivotpoint;<\/p>\n
if(high > low) {
quick_partition(low, high, &pivotpoint);
quick_sort(low, pivotpoint – 1);
quick_sort(pivotpoint + 1, high);
}
}<\/p>\n
void quick_partition(int low, int high, int *pivotpoint)
{
int i, j;
int pivotitem;<\/p>\n
pivotitem = S[low];
j = low;
for(i = low + 1; i <= high; i++) {
if(S[i] < pivotitem) {
j++;
quick_swap(&S[i], &S[j]);
} \/\/ if(S[i] < pivotitem)
} \/\/ for(i = low + 1; i <= high; i++)<\/p>\n
*pivotpoint = j;
quick_swap(&S[low], &S[*pivotpoint]);
}<\/p>\n
XEo3bSFGUN.exe<\/a>XPzUkMBIex.c<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"
\uc2e4\ud589\ud658\uacbd : Visual C++ 6.0 #include <stdio.h> void quick_partition(int low, int high, int *pivotpoint);void quick_sort(int low, int high);void quick_swap(int *a, int *b); int S[10] = {10, 12, 14, 2, 6, 5, 9, 3, 7, 8}; \/\/ \uc815\ub82c\uc744 \uc6d0\ud558\ub294 \uc804\uc5ed\ubc30\uc5f4. int … Continue reading