Can any one tell me how I can divide an integer by a power of 2 using
the bitwise & operator and the restrictions of doing this?

Thanks,
Doug

Using &? Well, I spose it's /possible/ but are you SURE you don't mean >> ?

A >> B right-shifts A by B bits. Each shift to the right divides by 2,
losing any remainder. Its effect on negatives can be surprising, though, so
take care.

Whilst I would love to spend the time working out how to do this with &,
right now I don't /have/ the time. Maybe tonight.

--
Richard H

#include "sig.h"

<snip>

That is an absolutely correct observation, but a little bit of
boolean algebra will show you that it is not possible to implement
bit-shift (eg division by a power of two) without using at least one
other operator.

For reference's sake, any* operation that deals with integers can
be coded using only the operations NOT and AND, and therefore by
DeMorgan's Theorem, NOT and OR. This is a provable fact.

* When I say "any", I say "any" because I can't be bothered to think
? of a proper defintion which really means something between
? "pretty much any" and "anything you'd want to do".

Cheers,
Wes

--


PageMail, Inc.??????????????????? |
Kingston, ON Canada?????????????? | Voice: (888) 247 6246