Q. Time complexity of fractional knapsack problem is

(A) o(n log n)
(B) o(n)
(C) o(n2)
(D) o(nw)

💬 Discuss

✅ Correct Answer: (A) o(n log n)

Explanation: as the main time taking a step is of sorting so it defines the time complexity of our code. so the time complexity will be o(n log n) if we use quick sort for sorting.

Published by Mr. Dubey ⭐ 111.42K Points at 16-Sep-2023 03:44 pm in Design and Analysis of Algorithms

Explanation by: Mr. Dubey

as the main time taking a step is of sorting so it defines the time complexity of our code. so the time complexity will be o(n log n) if we use quick sort for sorting.

💬 Discussion

📊 Question Analytics

👁️

709

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

96%

Success Rate

Q. Time complexity of fractional knapsack problem is

Explanation by: Mr. Dubey

💬 Discussion

Related MCQs

📊 Question Analytics