|
memoization
to the best of my understanding memoization is a way to cut time it takes to traverse a tree. i been told, i have a big tree (2^32), to use memoization because it can save time.
my problem is trying to understand how to creating caching system, one code told me that i should store an array of values but how would the indexing work on that?
do i need to add another parameter to my recursive function to store an index position or what?
|