Question

QUESTION 5

1. What is the worst-case complexity of line 10 of function bar?

1 2 int bar (int* A, int* B, int N) P { int count = 0; for (int i = 0; i < N; ++i) 00 voow int x = A[i]; int pos = sequentialOrderedSearch (B, N, x); if (pos >= 0 && B[pos] == x) 9 10 ++count; 11 12 13 return count; 14 -}

	A.	O(1)
	B.	O(N)
	C.	O(i)
	D.	O(log N)
	E.	O(sqrt N)
	F.	O(A[i])
	G.	O(N sqrt N)
	H.	O(N log N)
	I.	O(N^2)
	J.	O(i^2)
	K.	None of the above

QUESTION 6

1. What is the worst-case complexity of lines 8-11 of function bar?

	A.	O(1)
	B.	O(N)
	C.	O(i)
	D.	O(log N)
	E.	O(sqrt N)
	F.	O(A[i])
	G.	O(N sqrt N)
	H.	O(N log N)
	I.	O(N^2)
	J.	O(i^2)
	K.	None of the above

QUESTION 7

1. What is the worst-case complexity of line 6 of function bar?

A.

O(1)

B.

O(N)

C.

O(i)

D.

O(log N)

E.

O(sqrt N)

F.

O(A[i])

G.

O(N sqrt N)

H.

O(N log N)

I.

O(N^2)

J.

O(i^2)

K.

None of the above

Answer 1

QUESTION 5
worst-case complexity of line 10 of function bar is O(1)
Answer:
O(1)

QUESTION 6
worst-case complexity of lines 8-11 of function bar is O(1)
Answer:
O(1)

QUESTION 7
worst-case complexity of line 6 of function bar is O(1)
Answer:
O(1)