QuickSort

C Program For Quick Sort

Source Code:Quick Sort

#include<stdio.h>
#include<conio.h>


void show(int A[20],int l,int r)
{
  int i;
  printf("\n");
  for(i=l;i<=r;i++)
  {
     printf("  %d",A[i]);
  }
}

int partition(int *A,int l,int r)
{
   int loc,t;
   loc=l;
   while(lA[r])
      {
	 t=A[loc];
	 A[loc]=A[r];
	 A[r]=t;
	 loc=r;
	 l=l+1;
      }
      while(A[loc]>=A[l] && loc>l)
      {
	 l=l+1;
      }
      if(A[loc]<A[l])
      {
	 t=A[loc];
	 A[loc]=A[l];
	 A[l]=t;
	 loc=l;
	 r=r-1;
      }
   }
   return loc;
}
void quick_sort(int *A,int l,int r)
{
   int loc;
   if(l<r)
   {
      loc=partition(A,l,r);
      quick_sort(A,l,loc-1);
      quick_sort(A,loc+1,r);
   }

}


void main()
{
  int A[20],n,item,i,ch,l,r;
  clrscr();
  printf("\nEnter left index and right index:");
  scanf("%d,%d",&l,&r);
  for(i=l;i<=r;i++)
  {
     printf("\nEnter element %d :",i);
     scanf("%d",&A[i]);
  }
  quick_sort(A,l,r);
   printf("\nAfter sorting the array is:\n");
   show(A,l,r);
  getch();
}