Register

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

Given a list of 10,000 elements, and if each comparison takes 2 µs, what is the fastest possible runtime for linear search?
asked 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?

asked
User Claviska
by
7.8k points

1 Answer

3 votes

Answer:

2 µs

Step-by-step explanation:

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

Related questions

Ask a Question
Welcome to Qamnty — a place to ask, share, and grow together. Join our community and get real answers from real people.

Categories

Other Questions

Compare and contrast an electric generator and a battery??
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
Link Copied!