Linear Search

$\backslash$table$[[0,,2,,2,,,7,8,9,0,11,12,1314,15,16,17,8,19],[-4,-2,0,,,,10,14,15,18,20,24,26,\backslash$table$[[27,29]],30,31,44,47),]]$

How many elements must be checked to try to find the value $18$ in the above array?

How many elements must be checked to try to find the value $-4$ in the array above?

How many elements must be checked to try to find the value $49$ in the array above?

How many elements must be checked to try to find the value $100$ in the array above?

Given that a data set has $n$ elements, what is the best case that could occur when linear searching for an element $($i$.$e$.$ where is the best place to find what you are looking for$)?$

What would be the complexity of the best case for linear search?

Given that a data set has $n$ elements, what is the worst case that could occur when linear searching for an element $($i$.$e$.$ where is the worst place to find what you are looking for$)?$

What would be the complexity of the worst case for linear search?