I am having a doubt in this question.
The binary search algorithm is implemented using recursion. Then the space complexity is :-
(1) O( 1 )
(2) O( n )
(3) O( logn )
(4) O(n logn )
According to me, the answer should be option 2.
Please explain the solution as well.