排序（起泡法排序）

#include<stdio.h>
int main()
{
 int a[10];
 int i, j, t;
 printf("input 10 number:\n");
 for (i = 0; i < 10; i++)
  scanf_s("%d", &a[i]);
 printf("\n");
 for (j = 0; j < 9; j++);
  for (i = 0; i < 9 - j; i++);
   if (a[i]>a[i+1])
   {
    t = a[i]; a[i] = a[i + 1]; a[i + 1] = t;
   }
   printf("the sorted numbers:\n");
   for (i = 0; i < 10; i++)
    printf("%d", a[i]);
   printf("\n");
   return 0;
}