If a linear search function returns -1, what does this indicate?The element was found on the first comparisonThe element was found after all comparisonsThe element was not found in the arrayThe element was found after approximately half of the comparisons

What happens if you perform a linear search on an empty array?It will find the target valueIt will return 0It will return -1It will cause an error

In linear search algorithm the Worst case occurs whenQuestion 4Answera.The item is not in the array at allb.The item is the last element in the arrayc.The item is the last element in the array or is not there at alld.The item is somewhere in the middle of the array

If an element is present multiple times in an array, what will a linear search return?The index of the last occurrence of the elementThe index of the first occurrence of the elementThe number of occurrences of the elementThe index of a random occurrence of the element

Which of the following code snippet performs linear search recursively? for(i=0;i<n;i++) { if(a[i]==key) printf("element found"); } LinearSearch(int[] a, n,key) { if(n<1) return False if(a[n]==key) return True else LinearSearch(a,n-1,key) } LinearSearch(int[] a, n,key) { if(n<1) return True if(a[n]==key) return False else LinearSearch(a,n-1,key) } LinearSearch(int[] a, n,key) { if(n<1) return False if(a[n]==key) return True else LinearSearch(a,n+1,key) }

The worst case in a linear search occurs when