:: Personal website of a Toronto web designer
Lately » Scrawls
Decipher the algorithm and win a $100,000 cash prize. Huh. As simple as that.
I got them all ten finally!
Towers of Hanoi, a well-known puzzle. A stack of disks of decreasing size is to be transported from the leftmost peg to another peg. One disk can be moved at one time. You can only place smaller disks on top of larger ones not the other way around.
:: Sasha, at 12:00 am on Thursday, 07. March 2002
Hm, code that in java, it's good programming exercise.
:: Davor, at 03:25 am on Thursday, 07. March 2002
I'v made a code that solves the problem using "recursion".
:: zoka, at 05:08 am on Thursday, 07. March 2002
Yes, there is such a problem in my book, but we haven't covered applets yet.
I may give it a try.
Zoka is right, the problem appears in the chapeter where "recursion" is covered.
:: Sasha, at 12:33 pm on Thursday, 07. March 2002
Useless scrawling facts:
Top 5 scrawlers:
(updated once a day)
556 Sasha
488 zoka
316 vitez-koja
235 Davor
58 mungos
