I think that a remainder can be larger than a divisor, but I'm not completely sure.
Chat with our AI personalities
No, cause the remainder might be bigger than divisor.
because the divisor wont work when you multiply it??
If the remainder is greater than the divisor then you can divide it once more and get one more whole number and then have less remainders.
int dividend,divisor,remainder; int division(int p,int q){ int quotient=1; /*if divisor and diviend are equal then quotient=1*/ if(p==q){ remainder=0; return 1; } /*if dividend is smaller than divisor then remainder=dividend*/ if(p<q){ remainder=p; return 0; } /*shift left till divisor > dividend*/ while(p>=q){ q<<=1; quotient<<=1; } /*shift right for one time so that divisor become smaller than dividend*/ q>>=1; quotient>>=1; /*again call division recurcively*/ quotient+=division(p-q,divisor); return quotient; } int main(){ cout<<"\nEnter dividend:"; cin>>dividend; cout<<"\nEnter divisor:"; cin>>divisor; cout<<"\nQuotient:"<<division(dividend,divisor); cout<<"\nRemainder:"<<remainder; //system("pause"); return 0; }
An Elephant is larger than a mouse