Question: 1. One programmer suggested the following version of the function, Find(A): } I int Find(SearchArray A) 51 } int i = 0; while ((A[i]>=
1. One programmer suggested the following version of the function, Find(A): } I int Find(SearchArray A) 51 } int i = 0; while ((A[i]>= 0) && (i < MaxIndex)) { ++i; return (i < MaxIndex) ? i: -1; Can you discover a flaw in the implementation of this program? [Hint: suppose that the array A contains no negative integers, and that your version of C has array index bounds checking that has been turned on. What happens when you execute Find(A)] Can you suggest a way to fix this program by changing just one line?
Step by Step Solution
3.42 Rating (146 Votes )
There are 3 Steps involved in it
The flaw in the implementation of the program is that the return statement is insid... View full answer
Get step-by-step solutions from verified subject matter experts
