Guys i have read an article somewhere regarding optimization of recursive fibonicci so that we donot need to calculate the sum that we have already calculated...
In case if factorial,we donot need to find factorial that we have already calculated... I just forgot where i read from..may br from coreman ..but i am not able to find this again in coreman..may be i have read online..anybody please shar link from whr i can read these..it would be of great help..thnx in advance -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
