Ask Question
9 September, 00:36

Merge sort has a o (n log2 (n)) complexity. if a computer can sort 1,024 elements in an amount of time x, approximately how long will it take the computer to sort 1,024 times that many, or 1,048,576 elements?

+5
Answers (1)
  1. 9 September, 03:25
    0
    1,048,576 is 1,024 times 1,024, 1,024 * 1,024 or 1,024 squared or 1,024^2. If a computer takes x amount of time to sort 1,024 elements then the relationship is a 1 to 1. Therefore the computer will take x times x or x^2 (x squared) amount of time to sort 1,048,576.
Know the Answer?
Not Sure About the Answer?
Find an answer to your question ✅ “Merge sort has a o (n log2 (n)) complexity. if a computer can sort 1,024 elements in an amount of time x, approximately how long will it ...” in 📘 Computers and Technology if you're in doubt about the correctness of the answers or there's no answer, then try to use the smart search and find answers to the similar questions.
Search for Other Answers