数据结构与算法_插入排序

#include<iostream>
#include<string> 
#include "string"
#include<vector>
#include<stack>
#include<stdlib.h>

#include"algorithm"
using namespace std;

vector<int> InsertSort(vector<int> array)
{
	vector<int> result;
	if(array.empty())
		return result;
		
	result = array;
	int len = array.size();
	
	//
	for(int i = 1; i < len; i++)
	{
		//取出第i个数，和前i-1个数进行比较，插入合适位置 
		int temp = result[i];
		int j = i-1;
		for(j; j >= 0&&result[j] > temp; j--)
		{
			result[j+1] = result[j];
		} 
		result[j+1] = temp;
	}
} 

int main()
{
	int arr[] = { 6, 4, 8, 1, 2, 3, 9 };
    vector<int> test(arr, arr + sizeof(arr) / sizeof(arr[0]));
    
    for(int i = 0; i < test.size(); i++)
	{
		cout << test[i] << " " ;
	}
	cout << endl;
	vector<int> ret = InsertSort(test);
	for(int i = 0; i < ret.size(); i++)
	{
		cout << ret[i] << " " ;
	}
	cout << endl;
	return 0;
}