We discussed problem of Tower of Hanoi earlier and written a recursive function to solve the problem, Recursive functions take lot of extra memory (New activation record for each call on the stack) (A detailed analysis of recursion is done in this post of mine).
Todays question is to write a Non-recursive function to solve problem of Tower Of Hanoi.
The function should not take more than O(n) time (n = number of Moves actually required to solve the problem) and O(1) extra space.
The signature of the function will be
/* The three char represents the characters representing three rods * and n is the number of discs (initially in s) */ void towerOfHanoi(char s, char d, char e, unsigned int n)