123 Eng

### Engineering the engineers™

Home
Source Codes
Engineering Colleges

Training  Reports
Seminar Reports
Placement Papers

Forums

Computer Science / IT
Electronics
Electrical
Mechanical
Chemical
Civil

CAT / MBA

GMAT / Foreign MBA
Latest Jobs

Displaying  Source Code(s)

 To Sort Elements Of The Array Using Quick Sort Algorithm. -------------------------------------------------------------------------------- Description : To Sort Elements Of The Array Using Quick Sort Algorithm. /************************************************************* TO SORT ELEMENTS OF THE ARRAY USING QUICK SORT ALGORITHM *************************************************************/ #include #include #define max 15 int beg,end,top,i,n,loc,left,right; int array[max+1]; //contains the various elements. int upper[max-1],lower[max-1]; //two stacks to store two ends of the list. void main() { void enter(void); void quick(void); void prnt(void); clrscr(); enter(); //entering elements in the array top=i-1; //set top to stack if (top==0) { printf(" UNDERFLOW CONDITION "); getch(); exit(); } top=0; if(n>1) { top++; lower[top]=1;upper[top]=n; while ( top!=NULL ) { beg=lower[top]; end=upper[top]; top--; left=beg; right=end; loc=beg; quick(); if ( begarray[right]) { temp=array[loc]; array[loc]=array[right]; array[right]=temp; loc=right; tr_fr_right(); } return ; } void tr_fr_right() { int temp; while( array[loc] > array[left] && loc!=left) { left++; } if(loc==left) return ; if(array[loc] < array[left]) { temp=array[loc]; array[loc]=array[left]; array[left]=temp; loc=left; quick(); } return ; }

Contribute content or training reports / feedback / Comments
job placement papers