/* * Find the first element in A that is * not also in B. */

01: int firstNotIn (int* A, int* B, int nA, int nB)

02: {

03: int pos = 0;

04: bool found = false;

05: while (pos < nA && !found)

06: {

07: if (find(B, B+nB, A[pos]) != B+nB)

08: found = true;

09: else

10: ++pos;

11: }

12: if (!found)

13: {

14: pos = -1;

15: }

16: return pos;

17: }

According to the copy-and-paste technique, how would you annotate line 5 of this function by the time you had determined the complexity of the entire loop? For the toolbar, press ALT+F10 (PC) or ALT+FN+F10 (Mac).