编辑代码

#include<iostream>
using namespace std;
void insort(int number[]){ 
	int i, j, k, tmp;
	for(j = 1; j < 11; j++){ 
		tmp = number[j];
		i = j - 1;
		while(tmp < number[i]){ 
			number[i+1] = number[i]; 
			i--;
			if(i == -1){
				break;	
			}		
		}
		number[i+1] = tmp;
		cout<<"第 "<<j<<" 次排序："; 
		for(k = 0; k < 11; k++){
			cout<<number[k]<<' ';
		}
		cout<<endl;
	}
}
 
int main(){
	int number[11] = {11,9,20,7,56,9,42,3,7,15,16}; 
	int i;
	printf("排序前：");
	for(i = 0; i < 11; i++){ 
		cout<<number[i]<<' ';
	}
	cout<<endl<<endl;
	insort(number);
	return 0;
}