16.4 Generate Power Set - solution 1 time complexity question


Hi everyone,

For solution 1 of 16.4 Generate Power Set, I understand that there are 2^n recursive calls. However, I don’t understand why we spend O(n) time within a call. There are no loops inside the method, only 2 lines to add and remove elements into the current selectedSoFar solution. I’ve struggled with this for a while, and I would appreciate it if anyone would be generous enough to help me.

Thank you