除2取余法,先得到的是低位,后得到的是高位。所以可以用栈思想计算
二、源码
2:
int a)
4: {
int i = 0, stack[10], r, s;
6:
do
8: {
9: r = a / 2;
10: s = a % 2;
11: stack[i] = s;
if (r != 0)
13: {
14: i++;
15: a = r;
16: }
while(r);
18:
for (; i >= 0; --i)
20: {
, stack[i]);
22: }
);
24: }
25:
int main()
27: {
int a;
);
, &a);
31: DeToBi(a);
return 0;
33: }