冒泡，插入，归并排序C++实现

//冒泡
//冒泡是后半段有序
void bubble0316(vector<int>& arr)
{
	for (int i = 0; i < arr.size(); i++)
	{
		for (int j = 0; j < arr.size()-i-1; j++)
		{
			if (arr[j] > arr[j + 1])
			{
				swap(arr[j], arr[j + 1]);
			}
		}
	}
}
//插入排序
//前面部分有序
void insert0316(vector<int>&arr)
{
	int n = arr.size();
	if (n == 0) return;
	for (int i = 1; i < n; i++)//要移动元素位置
	{
		int temp = arr[i];//存储待插入数据
		int j = i - 1;//取前一位置索引，进行比较，只需要比较当前位置前面的有序元素，取j-1更方便
		for (; j >= 0 && arr[j] > temp; j--)
		{
			arr[j+1] = arr[j];//后移
		}
		arr[j+1] = temp;
	}
}
//归并
//将数组分解成一系列有序数组后合并，使用一个临时数组存储两个有序数组的合并
//合并时要输入中间位置索引方便分开两个有序序列
void merge0316(vector<int>&arr, int start, int mid, int end, vector<int>&temp)
{
	int istart = start;
	int iend = mid;
	int jstart = mid + 1;
	int jend = end;
	while (istart <= iend && jstart <= jend)
	{
		if (arr[istart] <= arr[jstart])
		{
			temp.push_back(arr[istart]);
			istart++;
		}
		else
		{
			temp.push_back(arr[jstart]);
			jstart++;
		}
	}
	while (istart <= iend)
	{
		temp.push_back(arr[istart]);
		istart++;
	}
	while (jstart <= jend)
	{
		temp.push_back(arr[jstart]);
		jstart++;
	}
	for (int i = 0; i < temp.size(); i++)
	{
		arr[start + i] = temp[i];
	}
	temp.clear();
	
}
void mergeSort0316(vector<int>&arr, int start, int end, vector<int>&temp)
{
	if (start >= end) return;
	int mid = (start + end) / 2;
	mergeSort0316(arr, start, mid,temp);
	mergeSort0316(arr, mid + 1, end, temp);
	merge0316(arr, start, mid, end, temp);
	
}

vector<int>v = { 4,1,5,2,3,6,9,7,8,0 };
	vector<int>temp;
	int n = v.size();
	cout << "排序前" << endl;
	for (auto ch : v)
	{
		cout << ch << " ";
	}
	cout << endl;
	//bubble0316(v);
	//insert0316(v);
	mergeSort0316(v, 0, n-1, temp);//end是最后位置的索引，不是数组大小

	cout << "排序后" << endl;
	for (auto ch : v)
	{
		cout << ch << " ";
	}
	cout << endl;
	system("pause");
	return 0;