subject:"\[algogeeks\] Recursion\!\!\!\!\!\!\!\!\!\!\! Always Stuck"

Re: [algogeeks] Recursion!!!!!!!!!!! Always Stuck

2010-09-15 Thread TurksHead Education

Recursion: http://www.rawkam.com/?p=283 Tower Of Hanoi: http://www.rawkam.com/?p=917 http://www.rawkam.com/?p=941 On Fri, Sep 10, 2010 at 1:11 AM, albert theboss wrote: > Its easy only

Re: [algogeeks] Recursion!!!!!!!!!!! Always Stuck

2010-09-09 Thread albert theboss

Its easy only tower of hanoi consist of three pegs peg A,peg B,peg C. which is used as BEG,AUX,END Let n be 5 for example... wat u r going to do is step 1 : move the top n-1 (4) disks from BEG to AUX... in this case END will be used as auxiliary. step 2: move the n th disk

[algogeeks] Recursion!!!!!!!!!!! Always Stuck

2010-09-09 Thread bittu

Can Anyone explain me how recursion works in C. i will be thankfull if he/she will use an example of towerofhanoi .??? Regards Shashank -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge..