Nth Prime

[cyeb]

All right, I plan on turning this into a sieve, but for now, not even finding the Nth prime works. :(

Here's my code:

#include "iostream"

using namespace std;

int main()
{
	int N;
	int primecount=0;
	
	cout << "I will find the <Nth> prime.\n\n  :";
	cin >> N;

	int* primes = new int[N];

	for (int loop = 2; loop <N; loop++)
	{
		for (int loop2 = 2; loop2<=loop/2; loop2++)
		{
			if (loop%loop2==0)
				break;
			else if (loop2==loop/2)
			{
				primes[primecount]=loop;
				primecount+=1;
			}
			else
				continue;
		}
	}

	cout << primes[primecount];
	cout << "\n\n\n";
	system("pause");
	return 0;
}

I suspect that this:
int* primes = new int[N];
Is giving me problems...

Any suggestions?

[helios]

You're not finding the Nth prime, you're finding all primes lower than N (assuming the algorithm is correct).
You don't need an array to do this.

[cyeb]

Ah, I'm sorry. That bit of code was in there from when I was testing it. I removed it, please check the code now.

[Dufresne]

primes[primecount]=loop;
primecount+=1;
cout << primes[primecount];

Here,
You're accessing wrong address. You shall first print number after you shall increment the values
Like;

primes[primecount]=loop;
cout << primes[primecount];
primecount+=1;

AFTER YOUR EDIT
cout << primes[primecount];
Instead of it , try
cout << primes[primecount-1];

[helios]

Still finding all primes lower than N.

[cyeb]

Thank you! Now it works, except instead of finding the Nth prime, it finds the prime closest to N. By the way, I found out that this code is extremely inefficient, and I have to overhaul the entire thing. >_> Thank you guys for the help.