printf("Input %d number to be sorted:\n",n); for (i=0;i<=n-1;i++) scanf ("%d",&a[i]); fini=count=times=0; for(i=1;i<n&&!fini;i++) { fini=1; count++; for (j=0;j<n-i;j++) if(a[j]>a[j+1]) printf("Input %d number to be sorted:\n",n); for(i=0;i<=n-1;i++) scanf("%d",&a[i]); fini=count=times=0; for(i=1;i<n&&!fini;i++) { fini=1; count++; for(j=0;j<n-i;j++) if(a[j]>a[j+1])