冒泡排序 选择排序 插入排序

void swap(int &a, int &b){int temp = a;a = b;b = temp;}//冒泡void sort0(int a[], int m){for(int i=0; i<m-1; i++){for(int j=0; j<m-i-1; j++){if (a[j] < a[j+1]){swap(a[j], a[j + 1]);}}}}//选择void sort1(int a[], int m){for(int i=0; i<m; i++){for(int j=i; j<m; j++){if (a[i] < a[j]){swap(a[i], a[j]);}}}}//插入排序void sort2(int a[], int m){for(int i=1; i<m; i++){int pick = a[i];int j = i - 1;while( j >=0  && a[j] < pick){swap(a[j], a[j+1]);j--;}a[j+1] = pick;}}