To Implement Quick Sort Program using C | Data Structures Lab Exercises

#include #include int i,j,n,pivot,a[20]; void quick(int a[],int left,int right); void swap(int a[],int i,int j); void main() { int n,a[20]; textcolor(15); clrscr(); printf("\n\nQUICK SORT"); printf("\n\nEnter the limit : "); scanf("%d",&n); textcolor(4); textcolor(5); clrscr(); printf("\n\nEnter the element\n\n"); for(i=0;i=pivot&&j>first) j--; if(i

SAMPLE INPUT AND OUTPUT:

Enter the limit : 5

Enter the elements
5
4
3
2
1

The sorted list is
1 2 3 4 5

⇓Student Projects⇓

⇑Student Projects⇑