(돌았어!)빠른 정렬의 귀속과 비귀속 실현.

1. 귀속 실현

#include 
#include

void quicksort(int a[],int s,int t){
int i=s,j=t;
if(si&&a[j]>=key)
j--;
if(i

2. 비귀속 실현

struct node
{
 int min;
 int max;
};
void fun(int min,int max,int a[])
{
 int key = a[min];
 int i = min;
 int j = max;
 int temp;
    struct node Stack[100];
    int top = 0;
    Stack[top].min = min;
    Stack[top].max = max;
 while(top>-1)
 {
    //min max 
    i = min = Stack[top].min;
    j = max = Stack[top].max;
    top--;
    key = a[min];
    while(i= a[i]))
        {i++;}
       if(i < j)
       {
         temp = a[i];a[i] = a[j];a[j] = temp; 
         j--;
       } 
     }//       
    if(min < i-1)
    {
        top++;
        Stack[top].min = min;
        Stack[top].max = i-1;
    }
    if(max>i+1)
    {
        top++;
        Stack[top].min = i+1;
        Stack[top].max = max;
    }
 } 
}

int main()
{
 int i;
 int a[10] = {49,38,65,97,76,13,27,9,2,1};
 for(i=0;i<10;i++)
  printf(" %d   ",a[i]);
 printf("
");
   fun(0,9,a);
 for(i=0;i<10;i++)
  printf(" %d   ",a[i]);
 printf("
");
 return 0;
}