紧跟之前的脚本,这个也是一个关于递归方面比较有名的算法:汉诺塔
#!/usr/bin/perl #author: peipei #date:2014_06_06 sub hanoi{ my ($n,$start,$end,$extra)=@_; if ($n == 1){ print "Move disk #1 form $start to $end. \n "; } else { hanoi($n-1,$start,$extra,$end); print "Move disk #$n from $start to $extra. \n"; hanoi($n-1,$extra,$end,$start); } } hanoi(5,A,B,C);
转载于:https://blog.51cto.com/artleaf/1422759