Where is the explanation of the clear bit function i am not abke to understand the function of clearing the bit from i to j

#1

please let me explain the these step;;;;
int n=15;
int i=1,j=3;
int m=2;
int one=(~0);
int a=one<<(j+1);
int b=(1<<i)-1;
int mask=a|b;
int ans=n&mask;
cout<<ans;

#2

Here you are just building a mask with bits from ith position to jth position as 0 such that when you perform and operation with the given number, those bits are cleared.
You will best understand by watching the video again. It is well explained there.
Watch the video again…mention the part of the video which you are unable to understand.

#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.