What is the time complexity of the brute force algorithm used to solve the assembly line scheduling problem?
|Answer» D. o(2n)|
|Explanation: in the brute force algorithm, all the possible ways are calculated which are of the order of 2n.|
Login to Continue
It will take less than 2 minutes