漫画算法笔记 桶排序

漫画算法笔记

桶排序

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

//桶排序
vector<double> bucketSort(const vector<double>& vec)
{
	//1.得到数列的最大值和最小值,并算出差值d
	double min, max;
	auto minMax = std::minmax_element(vec.begin(), vec.end());
	min = *minMax.first;
	max = *minMax.second;
	double d = max - min;
	//2.初始化桶
	int bucketNum = vec.size();
	vector<multiset<double>> bucketVec(bucketNum);
	//3.遍历原始数组,并将每个元素放入桶中
	for ( int i = 0; i < vec.size(); ++i )
	{
		int num = static_cast<int>( (vec[i] - min) * (bucketNum - 1) / d );
		bucketVec[num].insert(vec[i]);
	}
	//4.输出全部元素
	vector<double> resVec(vec.size());
	int index = 0;
	for( auto &set : bucketVec )
	{
		for ( double val : set )
		{
			resVec[index++] = val;
		}
	}
	return resVec;
}

int main(int argc, char** argv)
{
	vector<double> vec = {4.12, 6.421, 0.0023, 3.0, 2.123, 8.122, 4.12, 10.09};
	vec = bucketSort(vec);
	std::copy(vec.begin(), vec.end(), std::ostream_iterator<double>(cout, " "));
	cout << endl;

	system("pause");
	return 0;
}