| Home | Sign up! | Projects | Seminars | Research Notes | Today's Lecture | About |

Update Seminar Form
 Course: Seminar Topic: Seminar Description: This was the second seminar presented by me along with my partner Atika Shirkot. As mentioned in the earlier seminar description, "Complexity" is linked to the concept of "Towers of Hanoi".
During the course of this seminar, we first explained what an algorithm is and how the implementation of an algorithm is done through reccursion and iteration.
Basically we find out that in reccursion the function goes on calling itself till we reach the desired result, whereas in iteration, the problem is solved through loops.

We also explained the simplicity of the term Complexity. Complexity though sounding very complex is a very simple concept. Say for example - we take the general formula we derived in Towers of Hanoi to find the time taken to move the 'n' number of disks from source to destination peg :-

Tn = 2n - 1
We take the 'time compexity' of the above formula to be only 2n. To give a general solution we can therefore, say that time complexity of any problem would be the term in the formula having the highest degree or power.
Hence, in reference to our earlier seminar we could say that complexity of the Towers of Hanoi problem is 2n. Your Password: