It is stated that complexity will be O(2^nn) but should not it be O(2^nlog(n)) ? as 2^n for no. of subsequences and log(n) for maximum no. of bits in n.
Complexity of finding all subsequences of a string
Yes you are right here.
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.