Almightytay4542 Almightytay4542
  • 21-11-2017
  • Computers and Technology
contestada

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?

Respuesta :

W0lf93
W0lf93 W0lf93
  • 30-11-2017
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.
Answer Link

Otras preguntas

Is monetary policy or fiscal policy the more effective short-term approach? Explain your answer.
Which expression would be easier to simplify if you used the commutative property to change the order of the numbers? A. 1/7 + (-1)+ 2/7B. - 15+(-25) +43C. 120+
Assume there is an equal mass of each gas at a given temperature and pressure. Arrange the following gases based on the amount of volume they occupy, from the l
24 feet in 10 seconds​
The most common way a group can engage in grassroots lobbying is by __________.
Marcus is planning an educational event and has decided to place an advertisement in the local paper. What must the advertisement include
Select the correct answer. Which question correctly completes this conversation? Juan: ___________ Ana: Peso cincuenta y cinco kilos. A. ¿Cuánto pesa él? B.
3. Which of the following is equivalent to (10a³b³) (5a³b²)?​
b) José Luis conecta la agenda electrónica que le comunica que tiene examen de inglés.
pls answer both.........