voidInsertSort(int* arr,int size){
for(int i =0; i < size -1; i++){
int end = i;int tmp = arr[end +1];while(end >=0){
if(arr[end]> tmp){
arr[end +1]= arr[end];--end;}else{
break;}}
arr[end +1]= tmp;}}
2.希尔排序
voidShellSort(int* arr,int size){
int gap = size;while(gap >1){
gap = gap /3+1;for(int i =0; i < size - gap; i++){
int end = i;int tmp = arr[end + gap];while(end >=0){
if(arr[end]> tmp){
arr[end + gap]= arr[end];
end -= gap;}else{
break;}}
arr[end + gap]= tmp;}if(gap ==1){
break;}}}
3.选择排序
intswap(int* a,int* b){
int tmp =*a;*a =*b;*b = tmp;}voidSelectSort(int* arr,int size){
int begin =0;int end = size -1;int max, min;while(begin < end){
min = begin;
max = end;for(int i = begin; i <= end; i++){
if(arr[min]> arr[i]){
min = i;}if(arr[max]< arr[i]){
max