Recursion: The numbers of a positive integer in a positive or reverse order

Enter a positive integer to output the number of digits in a recursive manner, requiring both positive and reverse order.

Well, this is just a small program for training recursion.

1#include <stdio.h>2 voidFunintn);3 voidFun2 (intn);4 intMainintargcChar*argv[])5 {6     intN;7scanf"%d",&n);8 Fun (n);9printf"\ n");Ten fun2 (n); One     return 0; A } - voidFunintN) - { the     intT; -     if(n==0) -     { -         return ; +     } -     Else +     { At=n%Ten; atFun (n/Ten); -printf"%d", T); -     } - } - voidFun2 (intN) - { in     intT; -     if(n==0) to     { +         return ; -     } the     Else *     { $t=n%Ten;Panax Notoginseng          -printf"%d", T); theFun2 (n/Ten); +     } A}

View Code

Recursion: The numbers of a positive integer in a positive or reverse order