插入排序InsertSort

void InsertSort(int *array,unsigned int n) { int i=0,j=0; int temp=0; for(i=1;i<n;i++) { temp = array[i];//store the original sorted array in temp for(j=i ; j>0 && temp < array[j-1] ; j--)//compare the new array with temp(maybe -1?) { array[j]=array[j-1];//all larger elements are moved one pot to the right array[j-1]=temp; } } } 

copy于维基百科.