For 1000 items, a sorting algorithm takes 10 seconds to run on machine A, but it takes only half that time to run in mac

Business, Finance, Economics, Accounting, Operations Management, Computer Science, Electrical Engineering, Mechanical Engineering, Civil Engineering, Chemical Engineering, Algebra, Precalculus, Statistics and Probabilty, Advanced Math, Physics, Chemistry, Biology, Nursing, Psychology, Certifications, Tests, Prep, and more.
Post Reply
answerhappygod
Site Admin
Posts: 899603
Joined: Mon Aug 02, 2021 8:13 am

For 1000 items, a sorting algorithm takes 10 seconds to run on machine A, but it takes only half that time to run in mac

Post by answerhappygod »

For 1000 items, a sorting algorithm takes 10 seconds to run on
machine A, but it takes only half that time to run in machine B.
Approximately how long will the algorithm take to run on machine B
for 4000 items if the time complexity of the algorithm is
O(n2).
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!
Top
Post Reply

Return to “Archived Questions & Answers”