Hi guys, what's up?
I would like to ask whenever I have replicated recursive call (meaning the same recursive call called for instance twice), why the time complexity of it is bigger than the time complexity if we do a recursive call in a dynamic programming(meaning having an array and storing the called recursive call to read it again if being called)
** intuitive if we are not having an array to store the replicated recursive call then implicitly I must do double work (double time) to get the data unlike if I have an array that's already stored my data ....but how would I know that the time for getting data from array is lesser than having a recursive call?! ***
In other words, why eliminating replicated recursive call is mandatory for decreasing the time complexity?!
thanks guys!