排序算法

1.冒泡排序

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

2.插入排序

void InsertSort(int a[], unsigned int n){int temp;unsigned int i;int j;for (i=1; i<n; i++) {temp = a[i];j = i - 1;while ((j >= 0) && (temp < a[j])) {a[j+1] = a[j];j--;}a[j+1] = temp;}}