0 votes 0 votes Algorithms tancet + – Balaji Jegan asked Oct 23, 2018 Balaji Jegan 303 views answer comment Share Follow See all 6 Comments See all 6 6 Comments reply Sayan Bose commented Oct 24, 2018 reply Follow Share 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). 1 votes 1 votes vannjot commented Sep 27, 2019 reply Follow Share option 2 is correct according to me. 0 votes 0 votes commenter commenter commented Sep 27, 2019 reply Follow Share What is the difference between options 2 and 4? 0 votes 0 votes vannjot commented Sep 28, 2019 reply Follow Share i guess option 4 means that the item is not present in the universal set containing all the items. Example -1 does not belong to Natural Numbers. 1 votes 1 votes `JEET commented Sep 29, 2019 reply Follow Share Answer $2$, $3$ and $4$ both should be correct. Also, the question looks to me poorly framed. What's the source of this question?? 0 votes 0 votes `JEET commented Sep 29, 2019 reply Follow Share @commenter commenter Both are same only. 0 votes 0 votes Please log in or register to add a comment.