Question

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(n^2)

(d) O(2^n)

The question was asked by my college professor while I was bunking the class.

Origin of the question is Assembly Line Scheduling topic in section Dynamic Programming of Data Structures & Algorithms II

Answer 1

Right answer is (d) O(2^n)

The best I can explain: In the brute force algorithm, all the possible ways are calculated which are of the order of 2^n.