## Invitation to Computer Science 8th Edition

25 comparisons$* \frac{1}{12,000}$ seconds/comparison $=0.002$seconds
The average number of comparisons for a 32 million long list, using binary search would be $25 .$ Here is the calculation: 25 comparisons $* \frac{1}{12,000}$ seconds/comparison =0.002seconds