solution of balagurusamy of chapter 7.9

#include<stdio.h>
main()
{
int i,j,n;
long unsigned a[1000],t;
printf("Enter the number of terms= ");
scanf("%d",&n);
printf("\n");
for(i=1;i<=n;++i)
{
printf("Enter number %d= ",i);
scanf("%lu",&a[i]);
}
for(i=1;i<=n-1;++i)
{
 for(j=1;j<=n-i;++j)
 {
  if(a[i]>a[i+j])
  {
    t=a[i+j];
    a[i+j]=a[i];
    a[i]=t;
  }
 }
}
printf("\nAscending order:\n");
for(i=1;i<=n;++i)
{
printf("%lu ",a[i]);
}
return 0;
}