Assuming that the input array V [ ] has at least one element in it, find an infeasible path in the data flow graph for the binsearch() function.

Transcribed Image Text:

int binsearch (int x, int V[], int n) { int low, high, mid; low = 0; high n -1; while (low V[mid]) low mid 1; else return mid; } return -1; } Figure 5.8 Binary search routine.