In Lecture : Prime Sieve of Eratosthenes
First, we’re iterating on all odd numbers and marking them initially as primes ie. 1. (i+=2 in line=25)
Then, from(Line=30) we’re iterating again on all odd numbers, and marking all multiples of
each odd number being iterated on, as not prime ie. 0.
Sir, Why are we checking if it is already marked prime (1) (Line=32)? Because all odd numbers are already
marked prime ie. 1.