C program for quick sort

/*Program of sorting using quick sort through recursion*/



#include<stdio.h>

#define MAX 30

enum bool { FALSE,TRUE };



void display(int arr[],int,int);



void quick(int arr[],int low,int up);





main()

{



       int n,i;  int array[MAX];

    printf("Enter the number of elements : ");

         scanf("%d",&n);

  for(i=0;i<n;i++)

     {

     printf("Enter element %d : ",i+1);

           scanf("%d",&array[i]);

      }

   printf("Unsorted list is :\n");



display(array,0,n-1);



printf("\n");



quick(array,0,n-1);



printf("Sorted list is :\n");



display(array,0,n-1);



printf("\n");



return 0;



}       /*End of main() */





void quick(int arr[],int low,int up)

  {

       int piv,temp,left,right;

enum bool pivot_placed=FALSE;

left=low;

right=up;



piv=low; /*Take the first element of sublist as piv */



if(low>=up)

  return ;



printf("Sublist : ");



display(arr,low,up);



/*Loop till pivot is placed at proper place in the sublist*/



 while(pivot_placed==FALSE)

    {



   /*Compare from right to left  */



    while( arr[piv]<=arr[right] && piv!=right )

    

      right=right-1;

   



      if( piv==right )



pivot_placed=TRUE;



if( arr[piv] > arr[right] )

 {

       temp=arr[piv];

       arr[piv]=arr[right];

       arr[right]=temp;

       piv=right;

}



/*Compare from left to right */



while( arr[piv]>=arr[left] && left!=piv )

      left=left+1;



if(piv==left)

    pivot_placed=TRUE;



if( arr[piv] < arr[left] )

 {

     temp=arr[piv];

     arr[piv]=arr[left];

     arr[left]=temp;

     piv=left;

 }



}   /*End of while */



    printf("-> Pivot Placed is %d -> ",arr[piv]);



   display(arr,low,up);



    printf("\n");

 

   quick(arr,low,piv-1);

 

   quick(arr,piv+1,up);



 }/*End of quick()*/





void display(int arr[],int low,int up)

  {



    int i;

      for(i=low;i<=up;i++)

        printf("%d ",arr[i]);

}                                                         

You may like these .

 1. Bubble sort in c
 
 2. Heap sort in c
 
 3. Insertion sort in c