冒泡法排序

#include <stdio.h>int main(){    int a[100];    int i,j,t;    int n;    printf("Please input n:");    scanf("%d",&n);    printf("\nPlease input %d numbers:\n",n);    for(i=0;i<n;i++)        scanf("%d",&a[i]);    printf("\n");    for(j=0;j<n-1;j++)    {        for(i=0;i<n-1-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<n;i++)        printf("%d",a[i]);    printf("\n");    return 0;}