Consider the problem of finding the position, p, of the last occurrence of a giv

Question

Consider the problem of finding the position, p, of the last occurrence of a given number, x, in an array, A. We thus want a function FindLast(A,n,x) with precondition: x occurs in A[1::n] (thus n >= 1) and with postcondition: returns p with 1 <= p <= n such that A[p] = x and x does not occur in A[p + 1::n].

Prove that your iterative algorithm is correct. This will involve stating a suitable

loop invariant.

Algorithm:

Consider the problem of finding the position, p, of the last occurrence of a given number, x, in an array, A. We thus want a function Find Last(A,n,x) with precondition: x occurs in A[1::n] (thus n >= 1) and with post condition: returns p with 1

Explanation / Answer

Yes, Code is perfectly fine, as it check the number in an array, one by one, & compares to returnVal, and then move to n+1 .

Related Questions

Navigate

• Browse (All)
• Browse C
• Subjects

---