Hanoi Tower Recursion


SUBMITTED BY: Guest

DATE: March 19, 2014, 6:41 p.m.

FORMAT: Java

SIZE: 541 Bytes

HITS: 6250

  1. public class Hanoi {
  2. public static void hanoi (int n,char depart,char arrivee,char aux) {
  3. if (n>0) {
  4. hanoi (n-1 , depart, aux , arrivee);
  5. System.out.println(depart + "->" + arrivee);
  6. hanoi (n-1 , aux , arrivee , depart);
  7. }
  8. }
  9. public static void main (String[] args){
  10. hanoi (3 , 'A' , 'B' , 'C'):
  11. }
  12. }

comments powered by Disqus