| ??? 12/05/01 15:12 Read: times |
#17298 - RE: fastest 32 bit division |
If the divisor is a fixed number, then the problem can be converted to a multiplication, which is easily done with multiple MUL and ADD instructions.
|
| Topic | Author | Date |
| fastest 32 bit division | 01/01/70 00:00 | |
| RE: fastest 32 bit division | 01/01/70 00:00 | |
| RE: fastest 32 bit division | 01/01/70 00:00 | |
| RE: fastest 32 bit division | 01/01/70 00:00 | |
| RE: fastest 32 bit division | 01/01/70 00:00 | |
| RE: fastest 32 bit division | 01/01/70 00:00 | |
| RE: fastest 32 bit division | 01/01/70 00:00 | |
| RE: fastest 32 bit division | 01/01/70 00:00 | |
| RE: fastest 32 bit division | 01/01/70 00:00 | |
| RE: fastest 32 bit division | 01/01/70 00:00 | |
| RE: fastest 32 bit division | 01/01/70 00:00 | |
RE: fastest 32 bit division | 01/01/70 00:00 |