插入排序

// quick qort and binary search.cpp: 主项目文件。
#include<iostream>
#include<cstdlib>
#include<ctime>
#define SIZE 100
#define SIZE_SEED 100
using namespace std;

void insert_sort(int arr[], int size)
{
	int temp;
	for ( int i = 1; i <= size; i++)
	{
		temp = arr[i];
		for ( int j = i - 1; j >= 0 && arr[j] > temp; j-- )
			arr[j+1] = arr[j]; //move to right
		arr[j+1] = temp;//反之arr[j]<temp时，则把temp放在arr[j]后面，即arr[j+1]
	}
}
void main()
{
    srand(unsigned int ( time (NULL)));
	int iarray[SIZE];
	/*
	|  生成10个随机数
	*/
	for ( int ix=0; ix<=SIZE; ix++ )
		iarray[ix]=(rand()%SIZE_SEED+1);

	insert_sort(iarray, SIZE );

	for ( int iy=0; iy<SIZE; iy++ )
		cout << iarray[iy] << "  ";
    cin.get();
    return ;
}