Prime Number in C++

#include <iostream>      
using namespace std;
  
int main()
{  
    int n, i, flag = 0;
    cout << "Enter the number: ";
    cin >> n;
    for(i = 2; i <= n/2; i++)
    {
        if(n%i == 0)
        {
            flag = 1;
            break;
        }
    }
    if ( n<=1) 
    {
      cout << "Prime number is greater than 1.";
    }
    else 
    {
        if (flag == 0)
          cout << n << " is a prime number." ;
        else
          cout << n << " is not a prime number." ;
    }
}

1. Start
2. Input the integer number `n`.
3. If `n` is less than or equal to 1
- Print `"Prime number is greater than 1."`
- End
4. Initialize a variable `flag` to 0 (this will indicate whether `n` has a divisor other than 1 and itself)
5. For `i` from 2 to `n/2` do:
- If `n` modulo `i` equals 0 (i.e., `n % i == 0`) then:
- Set `flag` to 1 (indicating `n` is divisible by `i`)
- Break out of the loop
6. After the loop, check the value of `flag`:
- If `flag` is 0, print `n` is a prime number
- Otherwise, print `n` is not a prime number
7. End