Answer TRUE or FALSE.

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

True
  • True
  • False

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

Since, for any given array (regardless of size), the most expensive problem instance occurs when the search value is in the last position of the array, this is indeed the worst case.