Register

Given a sorted list of 1024 elements, what is the runtime for binary search if the search key is less than all elements in the list?

Given a sorted list of 1024 elements, what is the runtime for binary search if the search key is less than all elements in the list?
asked 73.3k views
3 votes
Given a sorted list of 1024 elements, what is the runtime for binary search if the search key is less than all elements in the list?

asked
User Stirman
by
8.6k points

1 Answer

3 votes

Answer: 1024

Linear search's runtime is proportional to the number of list elements.

answered
User Daron
by
8.0k 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!