Recursive in Data Structure And Algorithm : Practice MCQ Questions & Answers with Explanations

After each call in the recursive algorithm, the size of n is reduced by 1. Therefore the optimal solution is T(n-1)+c.

As binary search requires comparison, it is required that the list be ordered. Whereas this doesn't matter for linear search.

The best case occurs when the given element to be found is at the first position. Therefore O(1) is the correct answer.

The function calls itself till the element is found. But at the 7th call it terminates as goes outside the array.

Provided that the search starts from the first element, the function calls itself till the element is found. In this case, the element is found in 4th call.

It is used when the size of the dataset is low as its runtime is O(n) which is more when compared to the binary search O(logn).

In the worst case scenario, there might be a need of calling the stack n times. Therfore O(n).

The recursive algorithm consumes more space as it involves the usage the stack space(calls the function numerous times).

The Iterative algorithm is faster than the latter as recursive algorithm has overheads like calling function and registering stacks repeatedly.