对于两个整数a和b, 求a/b,可以从1开始枚举结果result,找到满足 result *b <= a的最大result即为所求,
这是一种可行的算法,但效率比较低,事实上,枚举result的时候,可以成倍的增加result,找到满足 result * b <= a的
最大result,然后把a减去 result * b, 接下来对余数a再次迭代,直到余数a比b小。
比如计算29/5的过程为:
(1)
a = 29, b = 5
找出满足b*i <= a的最大i, 依次计算:
b*1 = 5, b*2 = 10, b*4 = 20
所以最大的i = 4, 然后把a减去b*4,result加上4
a = a - b*4 = 9
result = result + 4 = 4
转步骤(2)
(2)
a = 9, b = 5
找出满足b*i <= a的最大i, 依次计算:
b*1 = 5
所以最大的i = 1, 然后把a减去b*1,result加上1
a = a - b*1 = 4
result = result + 1 = 5
转步骤(3)
(3)
a = 4, b = 5, a < b 算法停止,最后余数为a = 4, 结果为result = 5
#include <stdio.h> #include <stdlib.h> #define MASK 0x80000000 int div_int(int x, int y) { unsigned int flag, a, b, result, i; flag = (x & MASK) ^ (y & MASK); /* 判断符号位 */ a = x = abs(x); b = y = abs(y); result = 0; if (b == 0) { printf("浮点数例外\n"); exit(0); } for (; a >= b; a -= b, b = y) { for (i = 1; b <= a; b <<= 1, i <<= 1); b >>= 1; i >>= 1; result += i; } if (flag) { return -result; } return result; } int main() { int a = -64; int b = 4; printf("%d\n", div_int(a,b)); return 0; }