#include main() { int a[6]={5,6,4,1,3,8}; int i,j,k=5,t; printf("before sorting:\n"); for (i=0; i<=k; i++) printf("%d ",a[i]); printf("\nafter sorting:\n"); for (i=0; i<=(k-1); i++) for (j=0; j<=(k-1-i); j++) if (a[j]>a[j+1]) { t=a[j]; a[j]=a[j+1]; a[j+1]=t; } for (i=0; i<=k; i++) printf("%d ",a[i]); printf("\n"); }