漫画算法笔记 计数排序

漫画算法笔记

计数排序

#include <iostream>
#include <stdlib.h>
#include <algorithm>
#include <vector>
#include <iterator>
#include <numeric>
using namespace std;

//计数排序
vector<int> countSort1(vector<int>& vec)
{
	//1.得到数列最大值
	int max = *std::max_element(vec.begin(), vec.end());
	//2.根据数列最大值确定统计数组的长度
	vector<int> countVec(max + 1);
	//3.遍历数组,填充统计数组
	for (int i = 0; i < vec.size(); ++i )
	{
		countVec[vec[i]]++;
	}
	//4.遍历统计数组,输出结果 
	int index = 0;
	vector<int> resVec(vec.size());
	for ( int i = 0; i < countVec.size(); ++i )
	{
		for ( int j = 0; j < countVec[i]; ++j )
		{
			resVec[index++] = i;
		}
	}

	return resVec;
}

//优化计数排序:稳定排序,节省空间
vector<int> countSort2(vector<int>& vec)
{
	//1.得到数列最大值和最小值,并算出差值
	int max, min;
	auto minMax = std::minmax_element(vec.begin(), vec.end());
	min = *minMax.first;
	max = *minMax.second;
	int d = max - min;
	//2.创建统计数组并统计对应元素的个数
	vector<int> countVec(d + 1);
	for (int i =0; i < vec.size(); ++i)
	{
		countVec[vec[i] - min]++;
	}
	//3.统计数组做变形,后面的元素等于前面的元素和
	std::partial_sum(countVec.begin(), countVec.end(), countVec.begin());
	//4.倒序遍历原始数列,从统计数组找到正确位置,输出到结果数组
	vector<int> resVec(vec.size());
	for (int i = vec.size() - 1; i >=0; --i)
	{
		resVec[countVec[vec[i] - min] - 1] = vec[i];
		--countVec[vec[i] - min];
	}

	return resVec;
}

void test01()
{
	vector<int> vec = {4, 4, 6, 5, 3, 2, 8, 1, 7, 5, 6, 0, 10};
	vec = countSort1(vec);
	std::copy(vec.begin(), vec.end(), std::ostream_iterator<int>(cout, " "));
	cout << endl;
}

void test02()
{
	vector<int> vec = {95, 94, 91, 98, 99, 90, 99, 93, 91, 92};
	vec = countSort2(vec);
	std::copy(vec.begin(), vec.end(), std::ostream_iterator<int>(cout, " "));
	cout << endl;
}

int main(int argc, char** argv)
{
	//test01();
	test02();

	system("pause");
	return 0;
}