#pragma once
#include <iostream>
#include <vector>
#include "Test.h"
#include <stdlib.h>
#include<algorithm>

using std::cout;
using std::endl;

void Sort(double* dArr, int nSize)
{
	if ( !dArr || nSize < 1)
		return;

	int i,j;
	for ( i = 1; i < nSize; i++)
	{
		double dTemp = dArr[i];
		for ( j = i; j > 0; j-- )<span style="white-space:pre">		</span>//將第i+1個元素按照順序拆入到前面i個元素中（從後往前遍歷）
		{
			if( dTemp < dArr[j-1] )<span style="white-space:pre">		</span>//若第i+1個元素比第j個元素小，則把j個到i個元素往後移動一個單位，直至第i+1個元素比第j個元素大
				dArr[j] = dArr[j-1];
			else
				break;
		}
		dArr[j] = dTemp;	
	}
}

void main()
{
	double* dArr = new double[10];
	for ( int i = 0; i < 10; i++ )
	{
		dArr[i] = rand();
		cout <<dArr[i]<<endl;
	}
	Sort(dArr,10);
	for ( int i = 0; i < 10; i++ )
		cout <<dArr[i]<<endl;

	delete[] dArr;
	system("pause");
}