it tells that recursion is the most optimum way of doing it…but O(N*N) is much better then O(2^N) I guess??
how can we say predict when to use recursion?
In subset problem hint. of Recuraion queation
hi @manthan.joshi.jiit please tell the question as well. You said O(n*n) is better than O(2^n) that is true, but can you think of an approach that works in O(n*n) ? If yes then share that as well.
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.