C++大学基础教程_7_8采用差值排序法排序数组

//_7_8_main.cpp
#include <iostream>
#include <iomanip>
#include <cstdlib>
#include <ctime>
using namespace std;

int main()
{
	const int arraySize =100;
	int a[arraySize] ;
	int insert;
	srand((unsigned)time(NULL));
	for(int i=0;i<arraySize;i++)
		a[i] = rand()%1001 ;//让数组产生1000以内的随机数
	cout << "Unsorted array:" << endl;
	for(int i=0;i<arraySize;i++)
	{
		cout << setw(4) << a[i];
		if((i+1)%arraySize == 0)
			cout << endl;
	}
	for(int next=0;next<arraySize;next++)
	{
		insert = a[next];
		int moveItem = next;
		while((moveItem>0)&&(a[moveItem-1]>insert))
		{
			a[moveItem] = a[moveItem-1];
			moveItem--;
		}//end while
		a[moveItem] = insert;
	}//end for
	cout << "\nSorted array:" << endl;
	for(int i=0;i<arraySize;i++)
	{
		cout << setw(4) << a[i];
		if((i+1)%arraySize == 0)
			cout << endl;
	}
	system("pause >> cout");
	return 0;

}