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

Need help with this slope question ASAP
Which food items must be inspected by the usda or department of agriculture
Which statement best describes the effect of Dorsey pulling the lever only once? a. Schaffer and Brown did not realize there was a second alarm. b. More engine
Convert 41 years into seconds. Convert 48 hours into seconds. Convert your age into minutes. Convert 1440 minutes into days.
If the weight of displaced liquid and the weight of an object are the same, the object will: (A) sink (B) float (C) float, but partially submerged
please help im begging!!​
An independent variable is the part of an experiment that is...
Part B Does the size of the particles change as the substance changes state?
Which form of government is China?
Which river runs through the center of Eastern Europe, flows through nine nations, and is a traditional trade and cultural exchange route?