For Linear Search, the worst case happens when the element to be searched is not present in the array. When it is not present, the element to be searched is compared with all the elements of array one by one. Therefore, the worst case time complexity of linear search would be Θ(n).