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
5.5k points

1 Answer

3 votes

Answer:

2 µs

Step-by-step explanation:

User Ricardo Faria
by
6.0k points