Unformatted text preview: (e.g., the DP-matrix). If the value is already available in D, then it does not make any recursive call, otherwise it does make the call. Once, the value is returned from the recursive call it is stored in D, so that the next time when it is needed no more recursive call is made. However, there is one catch to this algorithm. If D is the DP-matrix its initialization will have the same asymptotic complexity as that of the DP algorithm (still the run time will be faster than that of DP). This can be avoided by using some innovative data structure for D, e.g., a hash table. Write the algorithm before you implement it. The algorithm is related to “memorization” [http://en.wikipedia.org/wiki/Memoization, http://cs.wellesley.edu/~cs231/fall01/memoization.pdf]. You need to implement all these algorithms and experiment with them (over problem set with large input sizes)....
View Full Document
This note was uploaded on 02/10/2012 for the course CSE 5211 taught by Professor Dmitra during the Spring '12 term at FIT.
- Spring '12