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

Given f(x)=x²+3x+4 , what is f(2+h)-f(2)/h equal to? a. 7+h b. 2x+h+3 c. h+4 d. h²+7h
The spinner below shows 5 equally sized slices. Ivanna spun the dial 20 times and got the following results.
Which statement correctly differentiates between the neuromuscular junction and the neuron to neuron synapse? A. There is no presynaptic neuron in the neuromusc
Cnnbc recently reported that the mean annual cost of auto insurance is 967 dollars. assume the standard deviation is 207 dollars. you take a simple random sampl
What does Merdeka Day commemorate?
Which of the following is/are essential for total health?Physical HealthMental and Emotional HealthSocial HealthAll of the above
What is marijuana? Give a detailed description.
What was the impact of the Sovietization of Eastern European countries? Group of answer choices Stagnant economic growth Increased economic prosperity Stre
What is the ppb concentration in a 200.0 L (200.0 kg) sample of water that contains 0.20 mg TCE? a) 1 ppb b) 10 ppb c) 100 ppb d) 1000 ppb
Which stage comes directly after interphase? A. G2 B. cytokinesis C. G1 D. S E. mitosis