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

¿Qué debe tener en cuenta una persona que busca empleo para asegurarse de conseguir un puesto que le dé satisfacción? ¿Qué aspectos o condiciones harían que un
The way all jobs in modern society ate connected to other jobs is called
What does the expression good riddance mean?
Which gospel artist recorded the song "move on up a little higher"?
Help me please! Giving 10 points and a thanks! Please answer the following questions: Give 3 reasons on why cloning is a good or bad idea. Give 3 reasons on why
A rainstorm in Syracuse started as a light drizzle at 1:00 pm, built up into a heavy rain, and then dropped back down to a drizzle. The rate at which it rained,
Which four parts of this excerpt from Stephen Crane's "The Open Boat" describe the narrator's opinion of the sea as a hostile entity?
How does the difference between fe and fo influence the outcome of a chi-square test?​?
simplify (3m+5)+7 (2m-2) show your work will Mark brainiest and be sure to simplify if you have time to answer a few more let me know
What is the steady state of contraction created by smooth muscle