The time complexity of external merge sort is approximately:

✅ The verified answer to this question is available below. Our community-reviewed solutions help you understand the material better.

The time complexity of external merge sort is approximately:

O

0%

O(log n)

0%

O(n²)

0%

O(n log n)

0%

Want instant access to all verified answers on lms.klh.edu.in?

Get Unlimited Answers To Exam Questions - Install Crowdly Extension Now!

Add to Chrome