#include <stdio.h>
#include "buildarray.c"
#include "sort.h"

unsigned long int compare=0,move=0;


void InsertSort(int *p,int n)
{
	int i,j,temp,count=0;
	for(i=1;i<n;i++){	//認(rèn)為只有一個(gè)數(shù)的情況下已經(jīng)是排好序,故i=0不考慮	
		temp=*(p+i);
		move++;
		for(j=i-1;j>=0;j--){
			if(temp>=*(p+j))
				break;
			else{ 
				*(p+j+1)=*(p+j);
				move++;
			}
			compare++;
		}
		*(p+j+1)=temp;
		move++;
	}
	printf("the queue sorted by insertsort is:\n");
	for(i=0;i<n;i++){
		printf("%d	",*(p+i));
		count++;
		if(count%10==0)
		printf("\n");
	}
}


main()
{
	//int Queue[9]={8,5,6,9,2,1,3,4,7};
	InsertSort(BuildArray(),NUM);
	printf("InsertSort compare=%ld,move=%ld",compare,move);
	printf("\n");	
}