Friday, June 11, 2010

CONTOH PROGRAM QUICK SORT C++

#include
#include
#define n 7
void main ()
{
int A[n]={15,10,7,22,17,5,12};
int X,I,K;
printf("Sebelum di-Sort \n");
for (I=0; I<=n-1; I++)
printf("%3i",A[I]);
printf("\n");
K=0;
while (K <=n-2)
{
I=0;
while(I<=n-2-K)
{
if(A[I]>A[I+1])
{
X=A[I];
A[I]=A[I+1];
A[I+1]=X;
}
I++;
}
K++;
}
printf ("Sesudah di Sort\n");
for(I=0; I<=n-1; I++);
printf("%3d",A[I]);
}

0 comments:

Post a Comment

 
Design by Free WordPress Themes | Bloggerized by Lasantha - Premium Blogger Themes | Laundry Detergent Coupons