c的冒泡排序算法

#include<stdio.h>
#include<stdlib.h>

void main(){
        int i, j, b, a[10]; printf("随机猜想数为：\n");
        for(i = 0; i < 10; i++){
                a[i] = rand();
                printf("%d\n",a[i]);
        }
        printf("按升序排列为：\n");
        for(i = 0; i < 9; i++){
                for(j = 0; j < 9 - i ; j++){
                        if(a[j] > a[j + 1]){
                                b = a[j];
                                a[j] = a[j + 1];
                                a[j + 1] = b;
                        }
                }
        }
        for(i = 0; i < 10; i++){
                printf("%d\n",a[i]);
        }
}

c的冒泡排序算法

原文：http://www.cnblogs.com/quan1/p/6696186.html