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

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

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

What happens if the search key is not present in the array in a Binary Search algorithm?The algorithm returns the closest value.The algorithm returns 1 or an equivalent value.The algorithm keeps searching indefinitely.The algorithm returns the last element.

In linear search, where is the target element checked?

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) }