Computer Science: An Overview: Global Edition (12th Edition)

Published by Pearson Higher Education
ISBN 10: 1292061162
ISBN 13: 978-1-29206-116-0

Chapter 5 - Algorithms - Section 5.6 - Efficiency and Correctness - Questions & Exercises - Page 262: 1

Answer

1⁄4 (10,000 - 100)

Work Step by Step

If the machine can sort 100 names in one second, it can perform 1⁄4 (10,000 - 100) comparisons in one second. This means that each comparison takes approximately 0.0004 seconds. Consequently, sorting 1000 names [which requires an average of 1⁄4 (1,000,000 - 1000) comparisons] requires roughly 100 seconds or 1 2⁄3 minutes.
Update this answer!

You can help us out by revising, improving and updating this answer.

Update this answer

After you claim an answer you’ll have 24 hours to send in a draft. An editor will review the submission and either publish your submission or provide feedback.