Prime Number program in (N*log(pow 1/2)N) complexity

prime_numbers.cpp

#include <iostream>
#include <vector>
using namespace std;

void generatePrime(int N) {
    vector <int> arrayList;
    vector <int> :: iterator i;
    arrayList.push_back(2);
    for( int i=3; i<=N; i+=2 ) {
        bool isPrime = true;
        for( int j=0; arrayList[j]*arrayList[j] <= i; j++ ) {
            if( i % arrayList[j] == 0) {
                isPrime = false;
                break;
            }
        }
        if(isPrime) {
            arrayList.push_back(i);
        }
    }
    // Loop for printing the array numbers
    for(i=arrayList.begin(); i != arrayList.end(); ++i) {
        cout << *i << endl;
    }
}
int main(void) {
    int N;
    cin >> N;
    generatePrime(N);
    return 0;
}