已知序列（25,16,32,18,20,36,12）请给出采用冒泡排序对该序列做升序排序时的每一趟结果

#include
#define N (sizeof(a) / sizeof(*a))
void display(int a[],int n);
int main() {
x05int a[] = {25,16,32,18,20,36,12};
x05int i,j;
x05printf("original:n");
x05display(a,N);
x05printf("sorted:n");
x05for (i = 0; i + 1 < N; ++i) {
x05x05for (j = 0; j + i + 1 < N; ++j) {
x05x05x05if (a[j + 1] < a[j]) {
x05x05x05x05int t = a[j];
x05x05x05x05a[j] = a[j + 1];
x05x05x05x05a[j + 1] = t;
x05x05x05}
x05x05}
x05x05display(a,N);
x05}
x05system("pause");
x05return 0;
}
void display(int a[],int n) {
x05int i;
x05for (i = 0; i < n; ++i) {
x05x05printf("%4d",a[i]);
x05}
x05printf("n");
}