Answer
The algorithm will print the prime numbers lass than 100
Work Step by Step
The algorithm uses a while loop from num to 99.
flag is initialized to 0 for each num.
The for loop checks if num is divisible by any i from 2 up to num/2.
If divisible, flag = 1.
After the loop, if flag == 0, num is printed.
This effectively prints prime numbers, since primes are not divisible by any number other than 1 and themselves.
num is incremented and the process repeats.
The only issue is that the algorithm will print number $1$ also, which is not prime.