第12章 取样问题

问题：从0~n-1中随机输出m个有序整数。

#include <iostream>
#include <set>
#include <algorithm>
using namespace std;

//返回至少30个随机位
int bigrand()
{
	return RAND_MAX * rand() + rand();
}

//产生[l, u]区间的随机数
int randint(int l, int u)
{
	return l + bigrand() % (u - l + 1);
}

void Sampling1(int * pArry, int m, int n)
{
	int j = 0;
	int i;
	for (i= 0; i < n; i++)
	{
		if (bigrand() % (n - i) < m)
		{
			pArry[j++] = i;
			m--;
		}
	}
}

void Sampling2(int * pArry, int m, int n)
{
	int i = 0;
	set<int> s;   //STL set容器中每个元素都不等，且key按严格弱序排列
	while (s.size() < m)
	{
		s.insert(bigrand() % n);
	}
	set<int>::iterator iter;
	for (iter = s.begin(); iter != s.end(); iter++)
	{
		pArry[i++] = *iter;
	}
}

void Sampling3(int * pArry, int m, int n)
{
	int i, j;
	int t;
	int * pTemp = new int[n];
	for (i = 0; i < n; i++)
	{
		pTemp[i] = i;
	}

	for (i = 0; i < m; i++)
	{
		j = randint(i, n - 1);  //生成随机数下标
		//根据随机数下标取数
		t = pTemp[i];
		pTemp[i] = pTemp[j];
		pTemp[j] = t;
	}
	sort(pTemp, pTemp + m);	//排序
	for (i = 0; i < m; i++)
	{
		pArry[i] = pTemp[i];
	}
	delete [] pTemp;
}