"Fundamentals of program design" Chapter 10 function and program structure 7-3 recursive realization of reverse order output integer (15 points)

This topic requires reading 1 A positive integer n, Then write recursive functions reverse(int n) Realize the output of the positive integer in reverse order .

Input format :

Enter... On one line 1 A positive integer n.

Output format :

Enter... For each group , Output in one line n In reverse order .

sample input :

12345

No blank lines at the end

sample output :

54321

No blank lines at the end

#include <stdio.h>
#include <string.h>
int reverse(int n);
int main()
{
	int n;
	scanf("%d",&n);
	int m=reverse(n);
    return 0;
}
int reverse(int n){
	int m;
	if (n==0){
		return 0;
	}
	m=n%10;
	n=n/10;
	printf("%d",m);
	reverse(n);
}