sort

冒泡排序

void bubble(int a[], int size){int i, j, tmp;for (i = 0; i < size; i++){for (j = size; j >= i; j--){if (a[j] < a[i]){tmp = a[i];a[i] = a[j];a[j] = tmp;}}}}

插入排序

void insert(int a[], int size){int i, j, tmp;for (i = 1; i < size; i++){tmp = a[i];for (j = i;  j > 0 & tmp < a[j -1]; j--){a[j] = a[j -1];}a[j] = tmp;}}

交换排序

void swap(int a[], int size){int i, j, tmp;for (i = 0; i < size -1; i++){for (j = i +1; j < size; j++){if (a[i] < a[j]){tmp = a[i];a[i] = a[j];a[j] = tmp;}}}}

选择排序

void select(int a[], int n){int i, j, min, t;for (i=0; i<n-1; i++){min = i; for (j=i+1; j<n; j++){if (a[j] < a[min]){   min = j;}}    if (min != i){t = a[i];a[i] = a[min];a[min] = t;}}}