Question
Consider the following dynamic programming implementation of the minimum jumps problem:#include#includeint min_jump(int *arr, int len){ int j, idx, jumps[len]; jumps[len - 1] = 0; for(idx = len - 2; idx >= 0; idx--) { int tmp_min = INT_MAX; for(j = 1; j
Answer: Option D
Was this answer helpful ?
None of the above mentioned "for loops can be used instead of the inner for loop. Note, for(j = idx + 1; j < len && j
Was this answer helpful ?
More Questions on This Topic :
Latest Videos
Latest Test Papers
Submit Solution