c++实现各种排序

最新推荐文章于 2024-07-19 13:40:17 发布

白昼行将

最新推荐文章于 2024-07-19 13:40:17 发布

阅读量540

点赞数

分类专栏： c++

本文链接：https://blog.csdn.net/jurui3973/article/details/80951520

版权

本文详细介绍了使用C++实现的七大经典排序算法，包括归并排序、冒泡排序、Shell排序、选择排序、插入排序、堆排序和快速排序，涵盖了不同类型的排序思想和方法。

摘要由CSDN通过智能技术生成

一、归并排序

#define _CRT_SECURE_NO_WARNINGS



#include<iostream>
#include<string>
#include<vector>
#include<set>
#include <cstdlib>
#include <cstddef>
#include <list>
#include <functional>
#include <unordered_map>
#include "tes2.h"
#include <algorithm>
#include <iterator>
#include <ostream>



using std::cin;
using std::cout;
using std::endl;
using std::string;
using std::vector;
using std::list;
using std::unordered_map;



void Msort(int *mat, int *temp, int left, int right);
void Merge(int *mat, int *temp, int left, int middle, int right);
void mergeSort(int *mat,int n)
{
	if (n ==  1) 
		return;
	int *temp = new int[n];
	Msort(mat, temp, 0, n - 1);

	delete[]temp;
	

}

void Msort(int *mat, int *temp, int left, int right)
{
	if (left < right)
	{
		int middle = (left + right) / 2;
		Msort(mat, temp, left, middle);
		Msort(mat, temp, middle+1, right);
		Merge(mat, temp, left, middle, right);
	}
}

void Merge(int *mat, int *temp, int left, int middle, int right)
{
	int first = left;
	int result = left;
	int endfirst = middle;
	int endsecond = right;
	middle++;
	while (left <= endfirst && middle <= endsecond)
	{
		if (mat[left] <= mat[middle])
			temp[result++] = mat[left++];
		else
			temp[result++] = mat[middle++];
	}
	while(left<=endfirst)
		temp[result++] = mat[left++];
	while (middle <= endsecond)
		temp[result++] = mat[middle++];

	for (int i = first; i < re