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

What is 14/48 in lowest terms
How did the french revolution effect george washington’s presidency
In the third stage of birth, the placenta, umbilical cord, and other membranes are expelled from the uterus. This stage of birth is called the _________
sarah has 150 books she read 4/5 how much does she have now?
According to Professor Zarkov's correlational data, there is a statistically significant relationship between the socioeconomic level of a family and how much t
How to you use a unit rate to solve a rate problem for any number of units?
Y= -3x +5 5x -4y = -3
5. A circle's circumference is 600 m. What is a good approximation of the circle's area? A. 300 m² B. 3,000 m2 C. 30,000 m² Dan boom2
What are the zeros of f(x) = x2 + x - 30? Ο A. X = -5 and x = 6 B. X = -6 and x = 5 Ο. O C. x = -2 and x = 15 O D. x = -15 and x = 2
What is the length of the shadow cast on the vertical screen by your 10.0 cm hand if it is held at an angle of θ=30.0∘ above horizontal?