Q. The complexity of merge sort algorithm is

(A) O(n)
(B) O(log n)
(C) O(n log n)
(D) None of these

💬 Discuss

✅ Correct Answer: (C) O(n log n)

Published by Mr. Dubey ⭐ 111.42K Points at 13-Sep-2023 11:13 am in Data Structure and Algorithms (DSA)

You must be Logged in to update hint/solution

💬 Discussion

📊 Question Analytics

👁️

398

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

83%

Success Rate