Simple Prime Number Generator

prime_list.cpp

// Include STL
#include <iostream>
#include <bitset>
#include <vector>
using namespace std;

template<int M>
void prime_list (vector<int> & list) {
    list.clear();
    bitset<M> s;
    int head = 2;
    while (head < M) {
        int p = head;
        while (p < M) {
            s[p] = 1;
            p += head;
        }
        s[head] = 0;
        head++;
        while (head < M && s[head]==1) {
            head++;
        }
    }
    for(int i=2; i<M; i++) {
        if(s[i]==0) {
            list.push_back(i);
        }
    }
}

using_prime_list.cpp

int main(int argc, char ** argv) {
  constexpr int MAXP = 1000 * 1000;
  vector<int> pl;
  prime_list<MAXP> (pl);
  for (int i=0; i<pl.size(); i++) {
    cout << pl[i] << endl;
  }
  return 0;
}