Torre de Hanói
/// find total number of steps
int towerOfHanoi(int n) {
/// pow(2,n)-1
if (n == 0) return 0;
return towerOfHanoi(n - 1) + 1 + towerOfHanoi(n - 1);
}
paramjeetdhiman