Question

Perform linear search where search key is 10 and searching time list 101,2,11,9,10,15. Write and explain the worst and best case of the algorithm.​

Answer 1

Answer:

\\\\\\\

Explanation:

\\\\

\

\\

\\\\

\

\\

\

\

\

Answer 2

Answer:

Linear Search

Start from the leftmost element of arr[] and one by one compare x with each element of arr[]

If x matches with an element, return the index.

If x doesn't match with any of elements, return -1.

Please mark me as brainliest