Answer TRUE or FALSE.

The worst case for the sequencial search algorithm occurs when the array size tends to infinity.

False
  • True
  • False

Worst case cost refers to the most expensive problem instance AS THE INPUT GETS BIG.

That is, worst case does not refer to what the input size it.

It refers to which input of a particular size is the worst one.

The worst case for sequential search occurs when the last element of the array (for whatever size) is the value being searched for.