MCQOPTIONS
Saved Bookmarks
| 1. |
Which line should be inserted in the blank to complete the following dynamic programming implementation of the maximum sub-array sum problem? |
| A. | Max_num(sum[idx 1] + arr[idx], arr[idx]) |
| B. | Sum[idx 1] + arr[idx] |
| C. | Min_num(sum[idx 1] + arr[idx], arr[idx]) |
| D. | Arr[idx] |
| Answer» B. Sum[idx 1] + arr[idx] | |