After much pondering, I figured it out. It's a little messy, but isn't all that bad:
[code] public static int Divide(int a, int b)
{
long c = a;
long d = b;

c = c & 0xFFFFFFFFl;
d = d & 0xFFFFFFFFl;

long lResult = (long)c / (long)d;

return (int)(lResult & 0xFFFFFFFFl);
}[/code]

Which can be shortened to this:
[code] public static int Divide(int a, int b)
{
// Basically, we treat them as longs then mask out the sign-
// extension.
return (int)(((long) a & 0xFFFFFFFFl) / ((long) b & 0xFFFFFFFFl));
}[/code]


[edit] Fixed a line break that vi added
[edit2] Fixed a small glitch with the second program

+a million

I'm wondering what kp will say, mostly :)

[quote author=iago link=board=5;threadid=3741;start=0#msg30547 date=1069445946]
I'm wondering what kp will say, mostly :)[/quote]

If you wanted unsigned division, why are you using Java? :P

[quote author=Kp link=board=5;threadid=3741;start=0#msg30550 date=1069446712]
[quote author=iago link=board=5;threadid=3741;start=0#msg30547 date=1069445946]
I'm wondering what kp will say, mostly :)[/quote]

If you wanted unsigned division, why are you using Java? :P
[/quote]

I did it in a fairly clean way, though!

I noted before that you can do unsigned multiply and divide by using signed numbers with > twice the bits.

I don't remember you noting that, but it's fairly logical if you think about it.

Yes. What you have to be careful about is that you need 64-bit signed numbers to handle 16-bit unsigned, unless there's some trick I missed.