Answer TRUE or FALSE.

The upper bound and lower bounds of the sequential search algorithm is in O(n) and \Omega(n) respectively.

False
  • True
  • False

Is this statement complete?

To make this statement correct, you need to add in which case you are measuring the lower and upper bounds.

This would be true for the worst case, but not the best case.