Cant get the whole concept of the question

#1

plzz explain on the concept of prime seive using bitset array

#2

@G_rahil,
There is no concept other than prime sieve itself, just use Bitset rather than boolean array, it will faster and space efficient, because in Bitset, bit is used, where as in bool 1 byte is used, and we know 1 bit is 8 times smaller then 1 byte.

Cant get the whole concept of question
#3

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.