What is the recurrence relation for the linear search recursive algorithm?OptionsT(n+1)+c2T(n-1)+cT(n-2)+cT(n-1)+c

Linear search(recursive) algorithm used in _____________

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 recurrence relation that arises in relation to the complexity of the binary search is _______.

The recurrence T(n) = 2T(n-1) + n, for n≥2 and T(1) = 1 evaluates to

Linear search(recursive) algorithm used in _____________ans.When the size of the dataset is largeWhen the dataset is unorderedNever usedWhen the size of the dataset is low Previous Marked for Review Next