Content deleted Content added
No edit summary |
No edit summary |
||
Line 182:
I had a thought on the subject of good examples -- how about the [[Tower of Hanoi]] algorithm? -- [[User:Tarquin|Tarquin]] 11:52 Jan 24, 2003 (UTC)
:Has there been any more consideration of this? I think the problem of demonstrating that the procedure terminates, and it always gets the right result might be a little tricky if you want to keep this informal. The other nice aspect is that there are two different approaches, one that is easy to do with a computer, and the "practical" one that is iterative, rather than recursive, and more economical in a number of ways. The number of moves of disks is the same, of course, unless you slip up, but the housekeeping for one is negligible and the other is a function of the number of disks in the stack (though I would not call it impractical for anything a person would be willing to carry out, or that I would be willing to watch carried out on my computer display). But it is a practical, mostly math-free procedure. Of course, it is sort of fun to see why it works to say that to move the stack of n on post i to post j, you first move the top n-1 to post 6-i-j. --[[User:Orcmid|Orcmid]] 02:33, 12 Mar 2004 (UTC)
===Reworked the First Paragraph===
| |||