直接插入排序

 

 

#include <stdio.h>

//@TODO 插入排序 由小到大递增排序
//@authod yeshaoting
//data[0]是监视哨
int n = 11;
int data[] = {0,2,1,5,7,4,3,0,6,9,8};

void insert_sort();
void main(int argc, char *argv[])
{
	insert_sort();
	return;
}

void insert_sort()
{
	for(int i=2; i<n; i++)
	{
		data[0] = data[i];
		int j = i-1;
		while(data[0]<data[j])
		{
			data[j+1] = data[j];
			j--;
		}
		data[j+1] = data[0];
	}

	for(i=1; i<n; i++)
	{
		printf("%d\t", data[i]);
	}
}