交换排序之冒泡排序 bubble sort

/* * file name: bubblesort.c * */#include <stdio.h>#define N 8int main(){        int a[N]={9,8,3,5,2,6,1};        int i,j,temp;        printf("unsorted array:\n");        for (i=0;i<N;i++)        {                printf("a[%d]= %d ",i,a[i]);        }        printf("\n");        for(j=0;j<N-1;j++)        {                for(i=0;i<N-j-1;i++)                {                        if(a[i]>a[i+1])                        {                                temp = a[i];                                a[i] = a[i+1];                                a[i+1] = temp;                        }                }        }        printf("sorted array:\n");        for(i=0;i<N;i++)        {                printf("a[%d] = %d ",i,a[i]);        }        return 0;}