Tower Of Hanoi

[harshchandra]

Can anyone tell me the complete algorithm analysis of Tower of Hanoi for n pegs and n disks.I really need it :sad:

[Narue]

>Can anyone tell me the complete algorithm analysis of Tower of Hanoi
Sure:

#include <iostream>

using namespace std;

int main()
{
  cout<<"I'm too lazy to do my own work\n";
  cout<<"I'm too stupid to realize that nobody will do my work for me\n";
  cout<<"I'll never amount to anything because I'm a cheating slacker"<<endl;
}

[phr0stbyt3]

wow... i think i found a site for your "analysis"

www.owned.gg

[Chainsaw]

I went into Google and typed

algorithm analysis of Tower of Hanoi

and it came right up with a bunch of interesting sites.

[jwenting]

or just click on the Gooooogle adds that show up in this thread for a lot of hot deals in and about Hanoi :)

[Dani]

Whoa! Let's not be this rude please folks. I did a google search for towers of hanoi and a bunch of informative links came up:

http://www.cut-the-knot.org/recurrence/hanoi.shtml
http://mathforum.org/dr.math/faq/faq.tower.hanoi.html

They should answer your question.

[Chainsaw]

Hey! That's what I said! I wasn't trying to be rude, just helpful!

Google is a wonderful resource for algorithms.

[jwenting]

just trying to make people think for themselves Dani... There's way too much "I don't want to think, I just want a canned solution so I won't fail my test" attitude these days.
If those people graduate without writing code they'll become problems for us as colleagues and we'll end up with more work as we'll have to do their work as well leading to unpaid overtime, missed deadlines, etc. etc.

[Dani]

Sorry guys for the confusion. I was actually leaning my comment towards Narue. ;)

[harshchandra]

Thanks guys , at last i got the solution.