9 ms·Sure, O(2^n) is an upper bound here. O(phi^n) is a tighter bound.by Mithrandir 12y agoSure, O(2^n) is an upper bound here. O(phi^n) is a tighter bound.