冒泡排序

#include <stdio.h>

int main(){
        int a[5]={21,45,58,34,11};
        int i,j,k;
        printf("排序前的数组:");
        for(i=0;i<5;i++){
                printf(" %d",a[i]);
        }
        for (i=0;i<4;i++){
                for(j=0;j<4-i;j++){
                        if(a[j]>a[j+1]){
                                a[j] ^= a[j+1];
                                a[j+1] ^= a[j];
                                a[j] ^= a[j+1];
                        }
                }
        }
        printf("\n排序后的数组:");
        for (i=0;i<5;i++){
                printf(" %d",a[i]);
        }
        printf("\n");
        return 0;
}