Is this the best way to check if a number is prime in c++

Question

Was trying to do RSA encryption, so im trying to get p and q. So I need to check if they are prime numbers. Is this how to do it, is there a faster more efficient way for bigger