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

a charge of 90 C passes through a wire in 1 hour 15 minutes . what is the current in the wire
a charge of 90 C passes through a wire in 1 hour 15 minutes . what is the current in the wire
what is the equation of a parabola whose vertex is (-4,7) and whose graph is 1/2 as wide as y=x^2
Exercise1. If we multiply by three the numerator of a fraction and add 12 to the denominator, the value of the fraction is three quarters, and if the numerator
Why can't you factor 2cosx^2+sinx-1=0 ?
After Pennsylvania experienced its oil boom in 1859, three other states discovered vast oil reserves. Name two of these states.
Why can't you factor 2cosx^2+sinx-1=0 ?
6^x+8=17^2x-2 can I have help
A bag of cookies can be shared equally among 2,3,4,5, or 6 people.What is the least number of cookies the bag could have? hat is the least number of cookies the
a moving company charges a flat rate of $85 plus and additional $0.17 per mile driven. How far must the company drive to earn at least $100? Round to the neares