1.

Consider the following implementation of the Wagner–Fischer algorithm: Which of the following lines should be inserted to complete the above code?

A. arr[i][j] = min
B. min = arr[i-1][j-1] – 1;
C. min = arr[i-1][j-1].
D. min = arr[i-1][j-1] + 1;View Answer
Answer» D. min = arr[i-1][j-1] + 1;View Answer


Discussion

No Comment Found

Related MCQs