Is the space consumed by the linear search(recursive) and linear search(iterative) same?No, recursive algorithm consumes more spaceNo, recursive algorithm consumes less spaceYesNothing can be said

Both time and space complexities are better in recursive than in non-recursive program.Both time and space complexities are better in non-recursive than in recursive program.Time complexity is better in recursive version but space complexity is better in non-recursive version of the program.Space complexity is better in recursive version but time complexity is better in non-recursive version of the program.

Which of the following statements is true? ans. Recursion uses more memory compared to iteration Recursion uses less memory compared to iteration Iteration is always better and simpler than recursion Recursion is always better than iteration

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

Linear search(recursive) algorithm used in ____

What is the advantage of recursive approach than an iterative approach? Options Consumes less memory Less code and easy to implement Consumes more memory More code has to be written