蛮力法之冒泡排序（C实现）

#include <stdio.h>

void DataSwap(int* data1, int* data2)    
{    
    int temp = *data1;    
    *data1 = *data2;    
    *data2 = temp;    
} 

void BubbleSort(int a[], int n) {
	int i, j;
	for (i=0; i<n-1; i++)
		for(j=0; j<n-1-i; j++)
			if (a[j+1]<a[j])
				DataSwap(&a[j], &a[j+1]);
}

int main() {  
    int i, a[100];  
    srand(time(0));  
    for ( i = 1; i < 101; ++i ){  
        a[i-1] = rand() % 1001;  
        printf( "%3d ", a[i-1] );  
        if(i%15==0) printf("\n");   
    }  
    printf("\n\n");  
    BubbleSort(a, 100);  
    for ( i = 1; i < 101; ++i ){  
        printf( "%3d ", a[i-1] );  
        if(i%15==0) printf("\n");   
    }  
    getch();  
    return 0;  
}  

运行效果图