/* * How many elements in the array A are * also in the array B? Assume B is sorted. */ int overlap (int* A, int* B, int N) { int count = 0; for (int i = 0; < N; ++i) { int x = A[i]; int pos = binarySearch (B, N, x); if (pos >= 0 && B[pos] == x) { ++count; } } return count; } 

According to the copy-and-paste technique, how would you mark up line 8 of this function by the time you had determined the complexity of lines 8-11?

I believe this is asking for what type of big O notation would be assigned to that particular line if you were only up to that line, for example.

for (int i = 0; i < n; i++) // O(1) n* =O(n^2)