Messages in this thread | | | Date | Mon, 7 Aug 2000 12:47:01 +0200 | From | Jamie Lokier <> | Subject | Re: 64 bit divide/mod in 2.4.0-test5 |
| |
suckfish@ihug.co.nz wrote: > for (i = 32; i--;) { [...] > for (p = digits; p != top; ++p) {
Hmm, O(digits^2)... Looks equivalent to bitwise long division to me. How does it compare in real time to the division algorithm and/or others?
-- Jamie
- To unsubscribe from this list: send the line "unsubscribe linux-kernel" in the body of a message to majordomo@vger.rutgers.edu Please read the FAQ at http://www.tux.org/lkml/
| |