以前上课时一直是用循环来分解一个整数,今天看到递归也可以,挺新鲜的;
1 binary_to_ascii( unsigned int value ) 2 { 3 unsigned int quotient; 4 quotient=balue/10; 5 if( quotient !=0 ) 6 binary_to_ascii( quotient); 7 putchar( value%10 +'0' ); 8 }
ps:标准并未说明递归需要堆栈,但堆栈非常适合于实现递归
以前上课时一直是用循环来分解一个整数,今天看到递归也可以,挺新鲜的;
1 binary_to_ascii( unsigned int value ) 2 { 3 unsigned int quotient; 4 quotient=balue/10; 5 if( quotient !=0 ) 6 binary_to_ascii( quotient); 7 putchar( value%10 +'0' ); 8 }
ps:标准并未说明递归需要堆栈,但堆栈非常适合于实现递归
转载于:https://www.cnblogs.com/sunchangjun/p/3908708.html