数据结构 递归算法.ppt

* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * 骑士游历问题的递归实现 const x:array[1.4,1.2] of integer =(1,2(2,1(2,-1(1,-2; var n,m:integer; a:array[1.30,1.2] of integer;