Question: Exercise 3 (a) Draw a control-flow graph for the following program: == int search (string A[], int N, string what) { int index = 0;

Exercise 3 (a) Draw a control-flow graph for the following program: == int search (string A[], int N, string what) { int index = 0; if ((N == 1) && (A[O] == what)) { return 0; } else if (N 0) { return -1; } else if (N > 1) { while(index
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
