Program to solve the problem of Tower of Hanoi using Recursion in C

#include<stdio.h>
#include<conio.h>
void tower(int,char,char,char);
void  main()
{
char beg='A', aux='B', end='C';
int n;
clrscr();
printf("\nEnter no. of disks: ");
scanf("%d",&n);
printf("\nsequence is: ");
tower(n,beg,aux,end);
getch();
}
void tower(int n, char beg,char aux, char end)
{
if (n>0)
{
tower(n-1,beg,end,aux);
printf("\n %d (%c to %c) ",n,beg,end);
tower(n-1,aux,beg,end);
}}                                                 

Output: