modulo 2 division question help

Would anyone know how to write a program that does binary division (modulo 2) for example, take the number 10110010 which is a binary number, and divides it by 1011 which is also a binary number, then see the remainder.

this is what i have so far, it works fine for normail integer division e.g 23 / 7

but it wont work for binary modulo 2 division


thanks in advance

Code:

---

int posndiv(int divdend, int divisor)
{
int quotient;
int bit_position =1;

if (dividend <=0) {
quotient = -1; /* error cond.: return -1 */
} else if(divisor <= 0) {
quotient = -1; /* error cond.: return -1*/
} else {
quotient = 0;

while ((dividend > divisor) && !(divisor & 0x80000000)){
divisor = divisor << 1;
bit_position = bit_position << 1;
}

while (bit_position > 0) {
if (dividend >= divisor) {
dividend = dividend - divisor;
quotient = quotient + bit_posiition;
}
divisor = divisor >> 1;
bit_position = bit_position >> 1;
}
}
return quotient; // quotient = dividend/divisor
}

---

Kudo's for using code tags on your first post!! Unfortunately to get the most out of code tags, you must format your code so it's readable. Try indenting your blocks with spaces.

>Would anyone know how to write a program that does binary division
this %2 doesn't work?!
please forgive me if i haven't understood your question correctly.

basically what i want my program to do, is binary division

Quote:

---

Originally posted by shaq8u
basically what i want my program to do, is binary division

---

What exactly is binary division? Give me an example of your expected input and output.

Quzah.

what it does is: given two binary numbers in ASCII form from std input, it returns the remainder after mod 2 division (xor).
this will then be used to implement crc error detecting method which ive already implemented.

this is an example of binary division

http://courses.cs.vt.edu/~csonline/...onTextOnly.html

>http://courses.cs.vt.edu/~csonline/...onTextOnly.html
404

Have you seen this?

its a great help thank you...it would be great if anyones ever written a code like this before, so maybe they could show me.

Ive seen code on the net, but its just way too big, and too hard to understand, im not an expert at C by any means. but thanks for the help guys

//divide by two
answer = num >> 1;
//divide by 4
answer = num >> 2;
//mod 2
answer = num & 0x01;
//mod 4
answer = num & 0x03;

is that what you mean?