Music, asked by AlyaSingh4766, 1 year ago

Let a be an array of integers and x be an integer. Prove that any searching algorithm that answers yes, if x is present in a, else answer no, needs at least n comparisons.

Answers

Answered by yuvi717

0

I don't know plz make it clear

Answered by BrainlyFIRE

2

Hi mate❤️

Please elaborate your question

Previous Question

Next Question

Similar questions

Math, 6 months ago

A sum of 64,000 produces an interest of 4,921 when compounded annually for 3 years. Find the rate of interest?

Environmental Sciences, 6 months ago

बाल मेले में बच्चे कैसे परिधान पहन कर आए थे कक्षा छठी हिमाचल लोक संस्कृति और योग...

Computer Science, 6 months ago

what is the defination of html...

Business Studies, 1 year ago

Leadership meaning, characteristics of a leader; leadership styles; initiating structure (production oriented) consideration (person oriented)...

Math, 1 year ago

On a shelf, the first row contains 25% more books than the second row and the third row contains 25% less books than the second row. If the total number of books contained in all the rows is 600, then find the number of books in the first row.

English, 1 year ago

sentence of ill pleased...

Science, 1 year ago

what are the three types of hetrophes and explain...

English, 1 year ago

rearrange-facial important / facial expressions / to us/are...