1. Engineering
  2. Computer Science
  3. bigo notation...

Question: bigo notation...

Question details

* 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 && seqSearch(B, nB, A[pos]) 0) 05: 06: pos 07: 08: if (pos> nA) 09: 10: pos: 12: 13: return pos 14:) According to the copy-and-paste technique, how would you mark up line 4 of this function by the time you had determined the complexity of the entire loop?

(Big-O Notation)

Solution by an expert tutor
Blurred Solution
This question has been solved
Subscribe to see this solution