例如,在下面的汉诺塔算法中:
input Number of disk
output Print: disk moved successfully
complexity O(n).
Tower(n , beg , aux , end)
1. If (n=1) then
Beg = end;
Return;
2. Call Tower(n-1 , beg ,end , aug );
3. Call Tower (1 ,beg ,aux ,end );
4. Call Tower (n-1,aux ,beg ,end);
辅助假设代表什么?