Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《Journal of Yangzhou University(Natural Science Edition)》 1988-03
Add to Favorite Get Latest Update

A LINEAR TIME COMPLEXITY ITERATIVE ALGORITHM OF THE HANOI TOWERS PROBLEM

Yin Xinchun (Department of Mathematics)  
In this paper, we present an iterative algorithm which can construct a representation of the solution by a senary number in O(n) time but O(2~n) space. A PASCAL program in APPLE Ⅱ of the algorithm is also given.
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
©2006 Tsinghua Tongfang Knowledge Network Technology Co., Ltd.(Beijing)(TTKN) All rights reserved