Answer to Question #4231 in C++ for shaniemae

/*I used a recursive function to calculate the quotient and the
remainder.*/

#include<stdio.h>
#include<iostream>
using
namespace std;
int x, y, r;

int division(int tempdividend, int
tempdivisor) {
int q = 1;
if (tempdivisor == tempdividend) {
r =
0;
return 1;
} else if (tempdividend < tempdivisor) {
r =
tempdividend;
return 0;
}

while (tempdivisor <= tempdividend)
{
tempdivisor = tempdivisor << 1;
q = q <<
1;
}
tempdivisor = tempdivisor >> 1;
q = q >> 1;
q = q +
division(tempdividend - tempdivisor, y);

return q;
}

int main()
{
int q = 0;
cout << "Enter x: ";
cin >> x;
cout
<< "Enter y: ";
cin >> y;
q = division(x, y);
cout <<
"( x divided y)" << endl;
cout << " q = " << q <<
endl;
cout << " r = " << r << endl;
return
0;
}