In divide and conquer, the time is taken for merging the subproblems is?

🎓 Coach ⭐ 104.48K Points

📊 Design and Analysis of Algorithms

Q. In divide and conquer, the time is taken for merging the subproblems is?

💬 Discuss

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

Explanation: the time taken for merging the smaller subproblems in a divide and conquer approach is mathematically found to be o(n log n).

the time taken for merging the smaller subproblems in a divide and conquer approach is mathematically found to be o(n log n).

💬 Discussion

👁️

958

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

87%

Success Rate