Is a number a prime number in C++?

The function IsPrime returns true if the given number is a prime number; otherwise, it returns false!

1. Prime Number Detection in C++:
2. Explanation of the C++ Code for Prime Number Detection:
3. Advantages and Disadvantages of Prime Number Detection in C++:

1.) Prime Number Detection in C++:

// PrimeNumbers.cpp : Defines the entry point for the console application.
// Nenad Hrg 2011 http://www.softwareok.de

#include <stdio.h>
#include <cmath>
#include <conio.h>

// conio.h is included to handle keyboard input

bool IsPrime(int number) {

// If number is less than or equal to 1, it is not a prime number
if (number <= 1) return false;

// 2 is a prime number
if (number == 2) return true;

// If the number is even (other than 2), it is not a prime number
if (number % 2 == 0) return false;

// Calculate the square root and round it down
int limit = floor(sqrt(number));

// Check possible divisors starting from 3
for (int i = 3; i <= limit; i += 2)
    // If i is a divisor, the number is not a prime number
    if (number % i == 0) return false;

// If no divisors were found, the number is a prime number
return true;
}

int main() {
// Iterate from 0 to 99 to find prime numbers
for (int i = 0; i < 100; i++) {
    if (IsPrime(i)) {
        // If i is a prime number, print it
        printf("A prime number: %d\n", i);
    }
}

// Display a message and wait for a keyboard input before ending the program
printf("Waiting for a keyboard input.\n");

// Wait for a key press
_getch();

return 0;
}

2.) Explanation of the C++ Code for Prime Number Detection:

3.) Advantages and Disadvantages of Prime Number Detection in C++:

Advantages:

Disadvantages: