Which scenario is ideal for using a linear search?When the array is sortedWhen the array is small or unsortedWhen the array is large and sortedWhen the array is multidimensional

In which of the following cases is a linear search particularly inefficient?Searching in a small arraySearching in a sorted arraySearching in a large, unsorted arraySearching for the first elemen

The Worst case occur in linear search algorithm when*1 pointA) Item is somewhere in the middle of the arrayB) Item is the last element in the array or is not there at allC) Item is the last element in the arrayD) Item is not in the array at all

Which of the following is a common use case for linear search?Searching in a database with indexed columnsSearching for an element in a list where the order is not guaranteedSearching for an element in a large sorted datasetPerforming a quick lookup in a dictionary

In a sorted array, which search algorithm is more efficient than linear search?*1 pointA. Binary SearchB. Quick SearchC. Bubble SortD. Merge Sort

What is the best case and worst case complexity of ordered linear search?