插入排序

#include <cstdio>
#include <ctime>
#include <algorithm>

#define N 100

using namespace std;

int f[N] = {0};

int main(){
	int i, j, t;
	srand((int)time(0));
	for(i=0; i<N; i++) f[i] = rand()%1000;
	for(i=1; i<N; i++){
		t = f[i];
		for(j=i; j>0 && f[j-1]>t; j--) f[j] = f[j-1];
		f[j] = t;
	}
	for(i=0; i<N; i++) printf("%d\n", f[i]);
}