Vidyalelo
Data Structure · Q195

Dynamic Programming in Data Structures

Programming · Data Structure · question 195

Q195

What is the time complexity of the brute force algorithm used to solve the assembly line scheduling problem?

A.
O(1)
B.
O(n)
C.
O(n2)
D.
O(2n)
Answer

Answer: Option D

Solution

Answer: Option D
No explanation is given for this question Let's Discuss on Board