Well this program is not as complex as it seems to be.

The first for loop runs from 0 to 100, and runs a test for checking whether its prime or not.

Then in the second for loop.
We now start the test at the individual level.
Our basic idea is to check if the number is divisible by any other number which is less than it. if it is divisible by a particular number it is not prime. Else it is.

The logic in j<=i/2 is that a numbers factor cannot be greater than the number divided by 2.

For eg: consider the number 16.
If we divide it by 2 , we get 8.
Now let us see the factors of 16.

1 , 2 ,4,8. But there are no other numbers that are greater than 16/2 as factors. That is the basic logic.

then the next line the % operator gives the remainder of division of the L.H.S with the R.H.S

So why are we interested in the remainder.
This is where we apply the concept that a factor of a number x, divides the number completely... so there is no remainder.
So basically the line says
If the remainder after dividing is 0, then set isprime=false.

After this we have the next line.
This seems to be confusing . but C/C++ syntax allows such writing. You can see the above code as this
or
then you cout<< the number. or else continue to the next statement.

Hope this has helped you

Look up the definition of a prime number, and you will see that
it is a number that can only be divisible evenly by itself and 1.

For example , 3 is a prime number because 3 can only be divided by its
self(3) and 1, without having any remainder left over,
3/3 = 1 remainder 0
3/2 is a decimal number
3/1 = 1 which is a whole number, with remainder 0

Now lets see what the loop does :

Read up on prime then you will get this algo.

That helps a lot, but i have one more question. After the second for loop there is

Is this the same a saying

Yes, its a mere notational advantage .
This applies to both for loops and if statements.

If the curly braces { } are absent. the loop only executes the next line.

This is actually meaning.

But its rather a notational advantage to write it that way. So its better off that you donot get lost with the corresponding braces

Its significane is known when we are programming on a large scale. I presume

Lets say that i = 16. In the second loop j is set to 2. 16 % 2 == 0 so is prime is false but then j is incremented to 3. 16 % 3 == 1 so is prime is set to true. which says that 16 is a prime number. What am i missing here because I know 16 isn't a prime number.

well it should have a break statement there but, when isPrime is set
to false in the loop, no matter what it will come out as false because its not being set true inside the loop, its only being set to false. So it wouldn't matter after it finds its first factor.