It seems that they don’t take into acount the lengths of the subsets, which have to be stored, and which are copied on each pass.
So, I think space and time complexities should be (N*2^N) (or maybe a tighter bound can be computed?)
1 Like
Also noticed this moment and the same question came up to my mind. It would be nice it it got fixed.