Question: /* * Find the first element in A that is * not also in B. */ 01: int firstNotln (int* A, int B, int
/* * Find the first element in A that is * not also in B. */ 01: int firstNotln (int* A, int B, int nA, int nB) 02:{ 03: int pos = 0; 04: while (pos < nA && find(B, B+nB, A[pos]) != B+nB) 05: { 06: ++pos; 07: } 08: if (pos >= nA) 09: { 10: pos=-1; 11:} 12:} 13: return pos; 14:} According to the copy-and-paste technique, how would you annotate line 4 of this function by the time you had determined the complexity of the entire loop?
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
