I am currently working on an evolutionary algorithm. I write a program to implement the crossover function, i.e., exchange k
elements between vectors A
and B
. Here is the code:
#include <algorithm>
#include <cstdio>
#include <ctime>
#include <iostream>
#include <iterator>
#include <random>
#include <set>
#include <vector>
using namespace std;
vector<int> reservoir_sampling(vector<int> input, int k)
{
vector<int> output(k);
int i;
for (i = 0; i < k; i++)
{
output[i] = input[i];
}
srand(time(nullptr));
while(i < input.size())
{
int j = rand() % (i+1);
if (j < k)
{
output[j] = input[i];
}
i++;
}
return output;
}
template<typename T>
void vprintf(vector<T> V)
{
for (T v : V)
{
cout << v << " ";
}
cout << endl;
}
void test()
{
// crossover between A and B at k points
vector<int> A = {0, 1, 2, 3, 4, 5};
vector<int> B = {6, 7, 8, 9};
printf("A: ");
vprintf(A);
printf("B: ");
vprintf(B);
int k = 2;
vector<int> outers = reservoir_sampling(A, k);
vector<int> inners = reservoir_sampling(B, k);
printf("outers: ");
vprintf(outers);
printf("inners: ");
vprintf(inners);
// uS = A + inners
vector<int> uS;
set_union(A.begin(), A.end(), inners.begin(), inners.end(), inserter(uS, uS.end()));
sort(uS.begin(), uS.end());
printf("uS = A + inners: ");
vprintf(uS);
// dS = uS - outers
vector<int> dS;
set_difference(uS.begin(), uS.end(), outers.begin(), outers.end(), inserter(dS, dS.end()));
sort(dS.begin(), dS.end());
printf("dS = uS - outers: ");
vprintf(dS);
}
int main()
{
test();
return 0;
}
Sometimes, the output is right, like:
A: 0 1 2 3 4 5
B: 6 7 8 9
outers: 3 4
inners: 9 7
uS = A + inners: 0 1 2 3 4 5 7 9
dS = uS - outers: 0 1 2 5 7 9
Sometimes, the output is not right, like:
A: 0 1 2 3 4 5
B: 6 7 8 9
outers: 3 1
inners: 9 7
uS = A + inners: 0 1 2 3 4 5 7 9
dS = uS - outers: 0 1 2 4 5 7 9
It turns out set_union
is always OK, but set_difference
is not. I don't have any clue where I am wrong. Almighty users of SO, please help me out!