For fractional knapsack, if items are already arranged according to profit by weight ratio, then best-case selection can be done in linear time.
Here, total items are:
$n=8$
So, best-case time complexity is:
$O(n)=O(8)$
Correct option is:
$\boxed{(a)\ O(8)}$
Online Test Series, Information About Examination,
Syllabus, Notification
and More.
Online Test Series, Information About Examination,
Syllabus, Notification
and More.