0 votes 0 votes Worst Case scenario in case of linear search algorithm is_______________. Item is somewhere in the middle of the array Item is not in the array at all Item is the last element in the array Item is the last element in the array or is not there at all Algorithms data-structures algorithms + – rsansiya111 asked Dec 6, 2021 recategorized Jul 6, 2022 by Lakshman Bhaiya rsansiya111 362 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
2 votes 2 votes Answer: D In both the cases n comparison required(n is number of elements in array) which is the worst case. And time complexity O(n). raja11sep answered Dec 6, 2021 raja11sep comment Share Follow See all 0 reply Please log in or register to add a comment.