Solving Tower of Hanoi in C

tower_of_hanoi.c

#include <stdio.h>
int count=0;
void hanoi(int n,char from,char to,char aux){
  if(n>0){
    hanoi(n-1,from,aux,to);
    ++count;
    printf("Disk %d from %c -> %c\n",n,from,to);
    hanoi(n-1,aux,to,from);
  }
}

int main(){
  int n;
  printf("Enter no of Plates : ");
  scanf("%d",&n);
  hanoi(n,'A','C','B');
  printf("\n%d steps involved!",count);
  return 0;
}