Recursive program on Tower of Hanoi

Recursive program on Tower of Hanoi.
import java.util.*;
class TowerHRec
{
    public static void main(String args[])
    {
        int n;
        char beg='A',aux='B',end='C';
        Scanner sc=new Scanner(System.in);
        System.out.println("Enter number of disks:");
        n=sc.nextInt();
        TowerHRec obj=new TowerHRec();
        obj.move(n,beg,aux,end);
    }
    void move(int n,char beg,char aux,char end)
    {
        if(n==1)
          System.out.println("Move "+n+" disks from "+beg+" -> "+end);
         
        else
        {
            move(n-1,beg,end,aux);
            System.out.println("Move "+n+" disks from "+beg+" -> "+end);
            move(n-1,aux,beg,end);
        }
    }
}
       
OUTPUT---
Enter number of disks:
4
Move 1 disks from A -> B
Move 2 disks from A -> C
Move 1 disks from B -> C
Move 3 disks from A -> B
Move 1 disks from C -> A
Move 2 disks from C -> B
Move 1 disks from A -> B
Move 4 disks from A -> C
Move 1 disks from B -> C
Move 2 disks from B -> A
Move 1 disks from C -> A
Move 3 disks from B -> C
Move 1 disks from A -> B
Move 2 disks from A -> C
Move 1 disks from B -> C

Comments

Post a Comment

Popular posts from this blog

Sort Boundary Elements Of A Matrix

ISC COMPUTER SCIENCE PRACTICALS 2009 BOUNDARY ELEMENTS Write a program to declare a matrix A[ ][ ] of order (m*n) where 'm' is the number of rows and n is the number of columns such that both m and n must be greater than 2 and less than 20. Allow the user to input positive integers into this matrix. Perform the following tasks on the matrix: (a) Sort the elements of the outer row and column elements in ascending order using any standard sorting technique. (b) Calculate the sum of the outer row and column elements. (c) Output the original matrix, rearranged matrix, and only the boundary elements of the rearranged array with their sum. Test your program for the following data and some random data. 1. Example : INPUT : M=3, N=3 1 7 4 8 2 5 6 3 9 OUTPUT : ORIGINAL MATRIX : 1 7 4 8 2 5 6 3 9 REARRANGED MATRIX : 1 3 4 9 2 5 8 7 6 BOUNDARY ELEMENTS : 1 3 9 8   4 5 7 6 SUM OF OUTER ROW AND OUTER COLUMN = 43     ISC COMPUTER SCIENCE PRACTICALS 2009 ...
Read more

Lucky Number In Java ISC

Write a program to generate and print lucky numbers less than a given number N. import java.util.*; class LuckyNumbers {//start of class public void accept(int n) {     int a[]=new int[n];     int c=n;     for(int i=0;i<n;i++){         a[i]=i+1;     } int del=1; System.out.println("Lucky Number Operation :n"); while(del<n) { for(int i=del; i<n; i+=del) { for(int j=i; j<n-1; j++) { a[j]=a[j+1]; } n--; } del++;     for(int i=0;i<n;i++){         System.out.print(a[i]+"");     }     System.out.println();  } //end of while System.out.print("Hence, the Lucky Numbers Less than equal to  " + c + " are : "); for(int i=0; i<n; i++) { System.out.print(a[i]+"   "); } }}//end of class OTPUT--- Hence, the Lucky Numbers Less than equal to  24 are : 1   3   7   13   19
Read more

Program to fill a square matrix of size ‘n*n” in a circular fashion (clockwise) with natural numbers from 1 to n*n, taking ‘n’ as input.

Program to fill a square matrix of size ‘n*n” in a circular fashion (clockwise) with natural numbers from 1 to     n*n, taking ‘n’ as input. import java.util.*; class Circular_Matrix     {      //start of class         public static void main()         {             Scanner sc=new Scanner(System.in);             System.out.print("Enter the number of elements : ");             int n=sc.nextInt();             int A[][]=new int[n][n];             int k=1, c1=0, c2=n-1, r1=0, r2=n-1;             while(k<=n*n)                 {                     for(int i=c1;i<=c2;i++)                 ...
Read more