Select one or more CORRECT statement(s) below. A top-down dynamic programming algorithm (with a memory function) incurs

[answerhappygod]

Select One Or More Correct Statement S Below A Top Down Dynamic Programming Algorithm With A Memory Function Incurs 1 (26.25 KiB) Viewed 29 times

Select one or more CORRECT statement(s) below. A top-down dynamic programming algorithm (with a memory function) incurs an extra cost managing the stack used for the recursion. A dynamic programming algorithm always requires at least an extra Omega(n) amount of space where n is the input size. A brute-force algorithm always has an exponential complexity in terms of the input size. A bottom-up dynamic programming algorithm solves and stores (if necessary) the solutions to all sub-problems (smaller instances), which facilitates the search for the solution to the original problem (original, larger instance). A top-down dynamic programming algorithm is always faster than a bottom-up algorithm because it doesn't need to solve all subproblems. All of the above are correct