A nave linear searching algorithm with negligible startup overhead takes two tenths of a second to find
Fantastic news! We've Found the answer you've been seeking!
Question:
A naïve linear searching algorithm with negligible startup overhead takes two tenths of a second to find an item in a list of 75,000 entries. The time budget for the searching algorithm in your program is three fourths of a second.
How big does the list of entries need to get before you need a better searching algorithm?
Related Book For
Introduction to Algorithms
ISBN: 978-0262033848
3rd edition
Authors: Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest
Posted Date: