Register
Given a list of 10,000 elements, and if each comparison takes 2 µs, what is the fastest possible runtime for linear search?
106k views
4 votes
Given a list of 10,000 elements, and if each comparison takes 2 µs, what is the fastest possible runtime for linear search?

User Claviska
by
7.8k points

1 Answer

3 votes

Answer:

2 µs

Step-by-step explanation:

User Ricardo Faria
by
8.5k points
← Prev Question Next Question →

Related questions

Ask a Question
Welcome to QAmmunity.org, where you can ask questions and receive answers from other members of our community.

9.5m questions

12.2m answers

Other Questions

How do you balance __H2SO4 + __B(OH)3 --> __B2(SO4)3 + __H2O
Can someone complete the chemical reactions, or write which one do not occur, and provide tehir types? *c2h4+h2o *c3h8 + hcl *c2h2+br2 *c4h10+br2 *c3h6+br2
Why is gold preferred as a superior metal over silver and bronze?
What is the evidence of a chemical reaction when the fireworks go off
Which of the following statements does not describe a physical property of a piece of chalk A. Chalk is solid B.chalk can be broken into pieces C. Chalk is white D. Chalk will bubble in vinegar
Link Copied!