第二章（插入排序的实现）

#include<iostream>
#include<vector>
#include<string>
#include<set>
#include<map>
#include<unordered_set>
#include<unordered_map>
#include<algorithm>
#include<xfunctional>
using namespace std;

int main(){
	int amount;
	cout << "intput the size(>=1) of the array:" ;
	cin >> amount;
	vector<int> arr(amount, 0);
	cout << "Input the element:";
	for (int i = 0; i < amount; i++){
		cin >> arr[i];
	}
	for (int i = 1; i < arr.size(); i++){
		int key = arr[i];
		int j;
		for (j = i - 1; j >= 0; j--){
			if (arr[j] > key) arr[j + 1] = arr[j];
			else break;
		}
		arr[j + 1] = key;
	}
	cout << "Result:";
	for (int i = 0; i < arr.size(); i++){
	cout << arr[i] << " ";
    }
	cout << endl;
	system("pause");
	return 0;
}